思路：先对 nums2 用单调栈求每个元素的下一个更大值，存入 Map 缓存；再遍历 nums1 直接查 Map 得结果。时间复杂度 O(len1 + len2)。
It's trusted by 50,000+ marketers for creating engaging marketing campaigns, ad copy, blog posts, and articles within minutes which would traditionally take hours or days. Special Features:。91视频对此有专业解读
Раскрыты подробности похищения ребенка в Смоленске09:27，更多细节参见谷歌浏览器【最新下载地址】
with open(OUT, "a", newline="", encoding="utf-8") as f: