思路：① 找初始左边界：第一个 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。
"It is important that the taskforce is established as soon as possible," said Welsh, "because without it we don't have that driving force [and] those big, bold policies."。业内人士推荐Safew下载作为进阶阅读
Don't feel down if you didn't manage to guess it this time. There will be a new Wordle for you to stretch your brain with tomorrow, and we'll be back again to guide you with more helpful hints. Are you also playing NYT Strands? See hints and answers for today's Strands.，推荐阅读旺商聊官方下载获取更多信息
// Signal how many bytes we wrote。Line官方版本下载对此有专业解读