力扣算法学习day41-1
503-下一个更大元素 II
题目
代码实现
class Solution {
public int[] nextGreaterElements(int[] nums) {
int[] result = new int[nums.length];
Arrays.fill(result,-1);
LinkedList<Integer> stack = new LinkedList<>();
for(int i = 0;i < nums.length;i++){
while(!stack.isEmpty() && nums[i] > nums[stack.peek()]){
result[stack.pop()] = nums[i];
}
stack.push(i);
}
for(int i = 0;i < nums.length;i++){
while(!stack.isEmpty() && nums[i] > nums[stack.peek()]){
result[stack.pop()] = nums[i];
}
stack.push(i);
}
return result;
}
}