思路：① 找初始左边界：第一个 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。
开局之年的“第一课”，习近平总书记特别强调了一个词——“适配度”：
Copyright © ITmedia, Inc. All Rights Reserved.，详情可参考搜狗输入法2026
Save StorySave this story
，推荐阅读搜狗输入法2026获取更多信息
Dominic Ethan Stewart was among 19 killed when vehicle veered off road and plunged down mountainside，更多细节参见爱思助手下载最新版本
TL;DR: Watch the 2026 MotoGP World Championship for free on ServusTV. Access this free streaming platform from anywhere in the world with ExpressVPN.