代码随想录算法训练营day58 739.每日温度 496.下一个更大元素|

最新推荐文章于 2024-10-09 22:28:58 发布

二木三金l

最新推荐文章于 2024-10-09 22:28:58 发布

阅读量242

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/m0_74100262/article/details/132080091

版权

题目链接739.每日温度

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.下一个更大元素|

class Solution {
    public int[] nextGreaterElement(int[] nums1, int[] nums2) {
        int lens = nums1.length;
        int[] res = new int[lens];
        Arrays.fill(res, -1);
        Stack<Integer> stack = new Stack<>();
        stack.add(0);
        HashMap<Integer, Integer> hashMap = new HashMap<>();
        for(int i = 0; i < nums1.length; i++){
            hashMap.put(nums1[i], i);
        }
        for(int i = 1; i < nums2.length; i++){
            if(nums2[i] <= nums2[stack.peek()]){
                stack.add(i);
            }else{
                while(!stack.isEmpty() && nums2[i] > nums2[stack.peek()]){
                    if(hashMap.containsKey(nums2[stack.peek()])){
                        int index = hashMap.get(nums2[stack.peek()]);
                        res[index] = nums2[i];
                    }
                    stack.pop();
                }
                stack.add(i);
            }
        }
        return res;
    }
}