739. 每日温度
题目链接:. - 力扣(LeetCode)
解题思路:单调栈
java:
class Solution {
public int[] dailyTemperatures(int[] temperatures) {
int lens=temperatures.length;
int []res=new int[lens];
Deque<Integer> stack=new LinkedList<>();
stack.push(0);
for(int i=1;i<lens;i++){
if(temperatures[i]<=temperatures[stack.peek()]){
stack.push(i);
}else{
while(!stack.isEmpty()&&temperatures[i]>temperatures[stack.peek()]){
res[stack.peek()]=i-stack.peek();
stack.pop();
}
stack.push(i);
}
}
return res;
}
}
496.下一个更大元素 I
题目链接:. - 力扣(LeetCode)
解题思路:还是单调栈
java:
class Solution {
public int[] nextGreaterElement(int[] nums1, int[] nums2) {
HashMap<Integer,Integer> map=new HashMap<>();
for(int i=0;i<nums1.length;i++)
map.put(nums1[i],i);
int res[]=new int[nums1.length];
Arrays.fill(res,-1);
Deque<Integer> stack=new LinkedList<>();
for(int i=0;i<nums2.length;i++){
while(!stack.isEmpty()&&nums2[i]>nums2[stack.peek()]){
int pre=nums2[stack.pop()];
if(map.containsKey(pre))
res[map.get(pre)]=nums2[i];
}
stack.push(i);
}
return res;
}
}