503. Next Greater Element II 下一个更大元素

Posted Long Long Journey

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了503. Next Greater Element II 下一个更大元素相关的知识,希望对你有一定的参考价值。

 Given a circular array (the next element of the last element is the first element of the array), print the Next Greater Number for every element. The Next Greater Number of a number x is the first greater number to its traversing-order next in the array, which means you could search circularly to find its next greater number. If it doesn‘t exist, output -1 for this number.

Example 1:

Input: [1,2,1]
Output: [2,-1,2]
Explanation: The first 1‘s next greater number is 2; 
The number 2 can‘t find next greater number;
The second 1‘s next greater number needs to search circularly, which is also 2.

Note: The length of given array won‘t exceed 10000. 


给定一个循环数组(最后一个元素的下一个元素是数组的第一个元素),为每个元素输出Next Greater Number。下一个更大数字x是数组中第一个更大的数字,这意味着您可以循环搜索以找到下一个更大的数字。如果不存在,则输出-1。

  1. /**
  2. * @param {number[]} nums
  3. * @return {number[]}
  4. */
  5. var nextGreaterElements = function (nums) {
  6. let res = [];
  7. res.length = nums.length;
  8. res.fill(-1);
  9. let stack = [];
  10. let index = 0;
  11. while (index < nums.length * 2) {
  12. let cur = nums[index % nums.length];
  13. while (stack.length > 0 && nums[stack[stack.length - 1]] < cur) {
  14. res[stack.pop()] = cur;
  15. }
  16. if (index < nums.length) stack.push(index);
  17. index++
  18. }
  19. return res;
  20. };
  21. //let nums = [2, 1, 1, 3];
  22. let nums = [1, 2, 1];
  23. let res = nextGreaterElements(nums);
  24. console.log(res);






以上是关于503. Next Greater Element II 下一个更大元素的主要内容,如果未能解决你的问题,请参考以下文章

503. Next Greater Element II

leetcode496 - Next Greater Element I - easy && leetcode503 - Next Greater Element II - medi

[栈] leetcode 503 Next Greater Element II

503. Next Greater Element II

503. Next Greater Element II 下一个更大元素

java 503. Next Greater Element II(1st).java