思路：链表转数组 + 单调栈（从后往前遍历）。与「下一个更大元素」模板一致，仅需将链表值先提取到数组。
思路：① 找初始左边界：第一个 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。。业内人士推荐同城约会作为进阶阅读
Real-time generation，这一点在旺商聊官方下载中也有详细论述
The latest move follows another senior appointment in China last year. In April 2025, LVMH named Daniel DiCicco president and chief executive of Louis Vuitton Greater China, in what was widely seen as a push to strengthen local management. DiCicco previously held senior positions at Apple, Sony Music and Coach, bringing cross-industry and digital experience to the role.