leetcode503 Next Greater Element II java
来源:互联网 发布:基于mac的acl 编辑:程序博客网 时间:2024/06/08 06:04
Description
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 Element I
public int[] nextGreaterElements(int[] nums) { int n=nums.length; int[] next = new int[n]; Arrays.fill(next,-1); Stack<Integer> stack = new Stack<>(); for(int i=0; i<2*n; i++) { int num = nums[i % n]; while(!stack.isEmpty() && num > nums[stack.peek()]) next[stack.pop()] = num; if(i < n) stack.push(i); } return next; }
0 0
- leetcode503 Next Greater Element II java
- LeetCode503. Next Greater Element II
- LeetCode503《Next Greater Element II》栈的应用
- Next Greater Element II
- Next Greater Element II
- Next Greater Element II
- leeocode_503. Next Greater Element II
- 503. Next Greater Element II
- leetcode-Next Greater Element II
- 503. Next Greater Element II
- 503. Next Greater Element II
- 503. Next Greater Element II
- 503. Next Greater Element II
- 503. Next Greater Element II
- 503. Next Greater Element II
- 503. Next Greater Element II
- 503. Next Greater Element II
- 496. Next Greater Element I \ 503. Next Greater Element II
- 自定义Toast
- ffmpeg处理RTMP流媒体的命令大全
- Spring系列(3/1)---交互的一种尝试
- PL/SQL开发常见SQL知识
- android小细节
- leetcode503 Next Greater Element II java
- Android跨应用Activity跳转
- caffe在prototxt文件加参数
- Spring系列(3/2)---交互的改进
- 求职旺季,你可能遇到的五大“惨案”
- 关于初始化列表的问题
- js 保存密码--记住我
- 消息盒子管理
- Android studio 2.3 Webp使用