思路：① 找初始左边界：第一个 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下载获取更多信息
Long exposure photographs showed the Falcon 9 rocket debris over Berlin in 2025
And, if a robot arm were to swing out towards you, for safety reasons you would want to be able to immediately stop it and push it back without harming yourself, reverse that motion instantly. For one thing, that requires a back-driveable actuator.
whole line of large-scale "ERM" business systems as GE had hoped, but it did