【LeetCode】42. Trapping Rain Water

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.

The above elevation map is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped. Thanks Marcos for contributing this image!

Example:

Input: [0,1,0,2,1,0,1,3,2,1,2,1]
Output: 6

思路：典型的单调栈，维护一个单调递减栈，只有遇到比栈顶大的时候才对栈顶进行更新，这里每次更新只是叠加下一个栈顶高度与当前高度最小者与pop的栈顶的差和之间距离的乘积，即当前高度u，下一个栈顶st.pop()，距离i-st.pop()-1

代码：

class Solution {
public:
    int trap(vector<int>& height) {
        int ans=0;
        stack<int> st;
        for(int i=0;i<height.size();i++){
            while(!st.empty()&&height[i]>=height[st.top()]){
                int u=height[st.top()];st.pop();
                if(!st.empty())ans+=(min(height[i],height[st.top()])-u)*(i-st.top()-1);
            }
            st.push(i);
        }
        return ans;
    }
};