But the final decision is yet to be taken. The fish disco will be tested for another six months in 2026 to establish more evidence it works.
思路：先对 nums2 用单调栈求每个元素的下一个更大值，存入 Map 缓存；再遍历 nums1 直接查 Map 得结果。时间复杂度 O(len1 + len2)。
。业内人士推荐谷歌浏览器【最新下载地址】作为进阶阅读
2 February 2026ShareSave
Copyright © 1997-2026 by www.people.com.cn all rights reserved