思路：先对 nums2 用单调栈求每个元素的下一个更大值，存入 Map 缓存；再遍历 nums1 直接查 Map 得结果。时间复杂度 O(len1 + len2)。
Adam posted a video about his experience queuing to see Deftones at the venue last week, which received a lot of engagement, with people sharing both similar and opposing experiences.
，推荐阅读快连下载-Letsvpn下载获取更多信息
* 时间复杂度: O(n^1.3)~O(n²) 取决于步长序列 空间复杂度: O(1) 稳定: ✗，详情可参考WPS下载最新地址
Фото: Valentyn Ogirenko / Reuters
Tyrrells plans to give vegetable crisps the chop