思路：① 找初始左边界：第一个 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。
"objectives": [
，推荐阅读谷歌浏览器【最新下载地址】获取更多信息
We believe this designation would both be legally unsound and set a dangerous precedent for any American company that negotiates with the government.，推荐阅读快连下载安装获取更多信息
NYT Pips hints, answers for February 28, 2026