代码随想录day59

503. 下一个更大元素 II

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

    }
}

42. 接雨水

class Solution {
    public int trap(int[] height) {
        // 接雨水
        int sum = 0;
        for(int i = 0 ;i < height.length;i++){
            if(i == 0 && i == height.length -1){
                continue;
            }
            int rHeight = height[i];  //记录右边柱子的最大高度
            int lHeight = height[i];           //记录左边柱子的最大高度
            for(int r = i + 1;r < height.length;r++){
                if(height[r] > rHeight){
                    rHeight = height[r];
                    // break;
                }
            }
            for(int l = i - 1;l >= 0;l--){
                if(height[l] > lHeight){
                    lHeight = height[l];
                    // break;
                }
            }
            int h = Math.min(rHeight,lHeight) - height[i];
            if(h > 0) sum += h;

        }
        return sum;

    }
}

单调栈

class Solution {
    public int trap(int[] height){
        int size = height.length;

        if (size <= 2) return 0;
        
        // in the stack, we push the index of array
        // using height[] to access the real height
        Stack<Integer> stack = new Stack<Integer>();
        stack.push(0);

        int sum = 0;
        for (int index = 1; index < size; index++){
            int stackTop = stack.peek();
            if (height[index] < height[stackTop]){
                stack.push(index);
            }else if (height[index] == height[stackTop]){
                // 因为相等的相邻墙，左边一个是不可能存放雨水的，所以pop左边的index, push当前的index
                stack.pop();
                stack.push(index);
            }else{
                //pop up all lower value
                int heightAtIdx = height[index];
                while (!stack.isEmpty() && (heightAtIdx > height[stackTop])){
                    int mid = stack.pop();
                    
                    if (!stack.isEmpty()){
                        int left = stack.peek();

                        int h = Math.min(height[left], height[index]) - height[mid];
                        int w = index - left - 1;
                        int hold = h * w;
                        if (hold > 0) sum += hold;
                        stackTop = stack.peek();
                    }
                }
                stack.push(index);
            }
        }
        
        return sum;
    }
}