思路：① 找初始左边界：第一个 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。
从“通用的大脑”到“在垂类真干活的大脑”
。Line官方版本下载对此有专业解读
Away from the crowds, work is underway to install a red carpet walkway to the venue for the Brit Awards next weekend, the first time the prestigious UK awards ceremony will be held outside of London.
https://www.washingtonpost.com/technology/2026/01/27/anthropic-ai-scan-destroy-books/