思路：① 找初始左边界：第一个 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。
let closed = false;
。业内人士推荐heLLoword翻译官方下载作为进阶阅读
入，这些极高值拉高了整体平均值。
Tech companies would have to block the images from being re-uploaded once they have been taken down.