代码随想录算法训练营day59 503.下一个元素更大|| 42.接雨水

题目链接503.下一个元素更大||

class Solution {
    public int[] nextGreaterElements(int[] nums) {
        if(nums == null || nums.length <= 1){
            return new int[]{-1};
        }
        int lens = nums.length;
        int[] res = new  int[lens];
        Arrays.fill(res, -1);
        Stack<Integer> stack = new Stack<>();
        for(int i = 0; i < 2 * lens; i++){
            while(!stack.isEmpty() && nums[i%lens] > nums[stack.peek()]){
                res[stack.peek()] = nums[i%lens];
                stack.pop();
            }
            stack.push(i%lens);
        }
        return res;
    }
}

题目链接42.接雨水

class Solution {
    public int trap(int[] height) {
        int lens =height.length;
        if(lens <= 2){
            return 0;
        }
        Stack<Integer> stack = new Stack<>();
        stack.push(0);
        int sum = 0;
        for(int i = 1; i < lens; i++){
            if(height[i] < height[stack.peek()]){
                stack.push(i);
            }else if(height[i] == height[stack.peek()]){
                stack.pop();
                stack.push(i);
            }else{
                while(!stack.isEmpty() && height[i] > height[stack.peek()]){
                    int mid = stack.pop();
                    if(!stack.isEmpty()){
                        int left = stack.peek();
                        int h = Math.min(height[i], height[left]) - height[mid];
                        int w = i - left - 1;
                        int hw = h * w;
                        sum += hw;
                    }            
                }
                stack.push(i);
            }
        }
        return sum; 
    }
}