思路：① 找初始左边界：第一个 nums[i] nums[i+1]；② 找初始右边界：最后一个 nums[i] < nums[i-1]；③ 求 [left,right] 内 min、max；④ 向左扩展：nums[left-1] minVal 则 left--；⑤ 向右扩展：nums[right+1] < maxVal 则 right++。长度 = right - left + 1。
Meanwhile, Oasis will discover whether their successful reunion over the past year has enhanced their reputation as legends in the US, a country they famously struggled to fully break first time around.。heLLoword翻译官方下载对此有专业解读
，更多细节参见下载安装 谷歌浏览器 开启极速安全的 上网之旅。
Bandwidth: My early code used a shocking amount of bandwidth
本次的年度征文设题很巧妙，体现了现代科技与传统人力对决的意思。，推荐阅读搜狗输入法2026获取更多信息