* 解题思路：先对nums2用单调栈求每个元素的下一个更大值，存入Map缓存；再遍历nums1直接查Map得结果
const res = new Array(len); // 结果数组：存储每个元素的下一个更大值
，详情可参考heLLoword翻译官方下载
30-day money-back guarantee
"I was pulling pipes off the houses to stop myself being dragged out - the wave was powerful enough to break doors and windows."