思路：先对 nums2 用单调栈求每个元素的下一个更大值，存入 Map 缓存；再遍历 nums1 直接查 Map 得结果。时间复杂度 O(len1 + len2)。
Have you experienced the new routing speed?
，推荐阅读服务器推荐获取更多信息
Get our weekend culture and lifestyle email
“I’ve been seeing stuff that people think it’s me, but if you watch the video, that’s not my voice and something that I never say,” Tkachuk said. “I don’t really know how that kind of took a storm on its own when I play here and give everything I have here.”
刷到某超级富豪家的春联，不仅谈不上对仗工整，就是两句俗话顺口溜，真是粗鄙无文，言不及义。