Nature, Published online: 26 February 2026; doi:10.1038/d41586-026-00603-y
思路：先对 nums2 用单调栈求每个元素的下一个更大值，存入 Map 缓存；再遍历 nums1 直接查 Map 得结果。时间复杂度 O(len1 + len2)。
。爱思助手下载最新版本是该领域的重要参考
开始弄清楚，你要如何进行持续自我教育。
While I was writing this blog post, Vercel's Malte Ubl published their own blog post describing some research work Vercel has been doing around improving the performance of Node.js' Web streams implementation. In that post they discuss the same fundamental performance optimization problem that every implementation of Web streams face: