思路：先对 nums2 用单调栈求每个元素的下一个更大值，存入 Map 缓存；再遍历 nums1 直接查 Map 得结果。时间复杂度 O(len1 + len2)。
"allObjectivesCompleted": false,，更多细节参见服务器推荐
。快连下载安装是该领域的重要参考
// console.log(spanner.next(85)); // 输出6（正确）。Line官方版本下载对此有专业解读
It was one of the greatest understatements of all time. The crew were in big trouble - a dramatic explosion had disabled their craft.