思路：① 找初始左边界：第一个 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。
code that I am expecting you to cut and paste, but to read and meditate on.
，推荐阅读搜狗输入法下载获取更多信息
Crawler-HttpClient: get_text(next_url)
Our special GTA 6 newsletter, with breaking news, insider info, and rumor analysis from the award-winning GTA 6 O'clock experts.。业内人士推荐旺商聊官方下载作为进阶阅读
Deep writing about biology, delivered to your inbox. Always free.，更多细节参见搜狗输入法2026
澎湃新闻援引宇树科技创始人王兴兴的采访内容指出，今年公司在人形机器人头部激光雷达、灵巧手等软硬件方面均有升级。