思路：先对 nums2 用单调栈求每个元素的下一个更大值，存入 Map 缓存；再遍历 nums1 直接查 Map 得结果。时间复杂度 O(len1 + len2)。
Discard new data: drop what's incoming
。关于这个话题，heLLoword翻译官方下载提供了深入分析
Гангстер одним ударом расправился с туристом в Таиланде и попал на видео18:08，详情可参考爱思助手下载最新版本
“US-China AI competition is continuing to intensify,” said Horowtiz, who is now a professor at the University of Pennsylvania. “This competition is not just taking place at the frontier, but in how China’s government is planning and implementing the day-to-day of their surveillance and information apparatus.”
Credit: AdGuard