思路：先对 nums2 用单调栈求每个元素的下一个更大值，存入 Map 缓存；再遍历 nums1 直接查 Map 得结果。时间复杂度 O(len1 + len2)。
Please logout and then login again, you will then be prompted to enter your display name.
，详情可参考一键获取谷歌浏览器下载
PinkPantheress will play London's All Points East festival alongside her Stateside collaborator Zara Larssson in August
void*wrap_malloc(unsigned long long n) { return malloc(n); }