思路：① 找初始左边界：第一个 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。
"This was really an "oh my God" moment," says the scientist behind the findings, Dr Peter Fretwell at British Antarctic Survey, who has worked on Emperor penguins for 20 years.，更多细节参见同城约会
Nasa is adding an extra mission to its Artemis programme before it attempts to land astronauts on the Moon for the first time in half a century.。雷电模拟器官方版本下载对此有专业解读
keywords for Google. You can type in any keyword you want, and a list of