这才是 Lambert 真正想说的部分，也是整件事里最被忽视的地方。
思路：① 找初始左边界：第一个 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。
。safew官方版本下载对此有专业解读
The other big stories (and deals) this morning
"The entire sequence of Artemis flights needs to represent a step-by-step build-up of capability, with each step bringing us closer to our ability to perform the landing missions. Each step needs to be big enough to make progress, but not so big that we take unnecessary risk given previous learnings."
，详情可参考搜狗输入法下载
Fraudsters could theoretically attempt to pass off a different insect species as one of those four.
Outgrown local demand and are ready to scale.，详情可参考爱思助手下载最新版本