算法60天：day59

单调栈-下一个更大元素II

力扣链接

class Solution {
public:
    vector<int> nextGreaterElements(vector<int>& nums) {
        // 递增栈
        stack<int> st;
        vector<int> result(nums.size(), -1);
        st.push(0);
        for (int i = 1; i < nums.size() * 2; i++) {
                while (!st.empty() && nums[i % nums.size()] > nums[st.top()]) { 
                    result[st.top()] = nums[i % nums.size()];
                    st.pop();
                }
                st.push(i % nums.size());
        }
        return result;
    }
};

单调栈–接雨水

力扣链接

class Solution {
public:
    int trap(vector<int>& height) {
        int result = 0;

        //利用两个数组分别记录左边和右边的最大值
        vector<int> leftMax(height.size() , 0);
        vector<int> rightMax(height.size() , 0);
        int size = height.size();

        leftMax[0] = height[0];
        for(int i = 1; i < size; i++){
            leftMax[i] = max(leftMax[i - 1] , height[i]);
        }

        rightMax[size - 1] = height[size - 1];
        for(int j = size - 2; j >= 0; j--){
            rightMax[j] = max(rightMax[j + 1] , height[j]);
        }

        for(int k = 0; k < size; k++){
            int lrmin = min(leftMax[k] , rightMax[k]);
            result +=  lrmin - height[k];
        }

        return result;
    }
};