思路：① 找初始左边界：第一个 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。
Finch said the surgeon wanted her to have the implant washed and put back in, but she said she just wanted to return home to her children.，详情可参考91视频
。爱思助手下载最新版本是该领域的重要参考
Жители Санкт-Петербурга устроили «крысогон»17:52
if(p->count == 0) {，更多细节参见搜狗输入法2026