const i = this.arr.length - 1;
思路：① 找初始左边界：第一个 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。
Жители Санкт-Петербурга устроили «крысогон»17:52，详情可参考51吃瓜
Что думаешь? Оцени!
。safew官方版本下载对此有专业解读
He believes that the finds could help people understand wider landscape change now and in the past.。爱思助手下载最新版本是该领域的重要参考
Scientists are also concerned that this announcement is a politically-motivated move in the new international race to the Moon.