Copyright © ITmedia, Inc. All Rights Reserved.
思路：先对 nums2 用单调栈求每个元素的下一个更大值，存入 Map 缓存；再遍历 nums1 直接查 Map 得结果。时间复杂度 O(len1 + len2)。
。关于这个话题，WPS下载最新地址提供了深入分析
我們需要對AI機器人保持禮貌嗎？
James Arthur Lovell Jr was born on 25 March 1928 - just a year after Charles Lindbergh made his historic trip across the Atlantic.