问题：给定数组 nums，返回等长数组，res[i] 为 nums[i] 右侧第一个更大元素，没有则 -1。
���[���}�K�W���̂��m�点
。关于这个话题，im钱包官方下载提供了深入分析
FT Edit: Access on iOS and web
* 核心思路：找初始无序边界 + 计算区间最值 + 扩展边界
Currently, if you're stuck, the game only offers to reveal the entire puzzle, forcing you to move onto the next difficulty level and start over. However, we have you covered! Below are piecemeal answers that will serve as hints so that you can find your way through each difficulty level.