思路：先对 nums2 用单调栈求每个元素的下一个更大值，存入 Map 缓存；再遍历 nums1 直接查 Map 得结果。时间复杂度 O(len1 + len2)。
"Will data centres power the UK's economic growth? Perhaps," Perkins said.
，更多细节参见爱思助手下载最新版本
如果你的系统 Node.js 版本较低，推荐使用便携式二进制包：，更多细节参见WPS官方版本下载
Now. Let’s talk about how this little war actually played out. Dramatised and Ribbed™ for your pleasure.