思路：先对 nums2 用单调栈求每个元素的下一个更大值，存入 Map 缓存；再遍历 nums1 直接查 Map 得结果。时间复杂度 O(len1 + len2)。
error prone. Maybe the compiler can do this transformation for us?
。快连下载安装对此有专业解读
"Our specialist archaeology team and contractors have carefully excavated numerous sites and have shown care and respect throughout this work."
It was his colleague Pete Manning who encouraged him to seek help after noticing his friend seemed to be struggling.
"Moving forward, age verification measures that verify age without retaining unnecessary personal identity information, and are transparent about data handling, are key," he said.