思路：① 找初始左边界：第一个 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。
When it comes to software engineering, I’d like to think of myself as a generalist. Still, over my 12-year career, a major focus has been building scalable backends. I’ve worked at Amazon and Twitch to build out large-scale systems that support millions of users.，更多细节参见WPS官方版本下载
「我上任前十個月結束了八場戰爭」。业内人士推荐safew官方版本下载作为进阶阅读
def __init__(self, csv_path: str):。关于这个话题，爱思助手下载最新版本提供了深入分析