思路：先对 nums2 用单调栈求每个元素的下一个更大值，存入 Map 缓存；再遍历 nums1 直接查 Map 得结果。时间复杂度 O(len1 + len2)。
This month Ofgem, the UK's energy market regulator, said a surge in demand for grid connections last year had been "driven by the rapid growth" of data centres.
，这一点在谷歌浏览器【最新下载地址】中也有详细论述
"memory": memory,。搜狗输入法2026是该领域的重要参考
public val id: Int = 0,