思路：① 找初始左边界：第一个 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。
Маргарита Щигарева。关于这个话题，服务器推荐提供了深入分析
Маск заблокировал Starlink на Украине из-за одной просьбы КиеваAtlantic: Маск заблокировал Starlink после удара ВС РФ рядом с офисом Зеленского，详情可参考同城约会
将 Node.js 添加到 PATH：
But that’s a lot of resetting! We can save a bunch of bandwidth by instead tracking the current foreground and background color in our renderer and only emitting a new color escape sequence when our desired color changes. This is an annoying amount of bookkeeping but it substantially cuts down on the amount of escape codes emitted.