思路：① 找初始左边界：第一个 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。
Полина Кислицына (Редактор)
，详情可参考51吃瓜
Looking for a guilt-free way to give your kids a little screen time? Pok Pok is the answer parents have been looking for — offering a Montessori-based approach to learning and fun for kids ages 2 to 8.
interoperability, with multiprotocol ATMs that supported multiple hosts, and