思路：① 找初始左边界：第一个 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。
民族要复兴，乡村必振兴。中华民族伟大复兴的事业波澜壮阔！
。搜狗输入法2026对此有专业解读
3014245510http://paper.people.com.cn/rmrb/pc/content/202602/27/content_30142455.htmlhttp://paper.people.com.cn/rmrb/pad/content/202602/27/content_30142455.html11921 中华人民共和国原子能法
"This is critical to preserving customer choice and ensuring that islanders can manage the costs associated with day to day motoring," he said.