接雨水（leetcode习题）

题目链接
https://leetcode-cn.com/problems/trapping-rain-water/
方法一：
动态规划

class Solution {
public:
    int trap(vector<int>& height) {
        if(!height.size()) return 0;
        vector<int> left_max_arr(height.size(),0);
        vector<int> right_max_arr(height.size(),0);
        left_max_arr[0] = height[0];
        right_max_arr[height.size()-1] = height[height.size()-1];
        for(int i = 1;i<height.size();++i){
            left_max_arr[i] = max(left_max_arr[i-1],height[i]);
        }
        for(int j = height.size() - 2;j>=0;--j){
            right_max_arr[j] = max(height[j],right_max_arr[j+1]);
        }
        
        int sum = 0;
        
        for(int i=0;i<height.size();++i){
            if(height[i]<left_max_arr[i] && height[i]<right_max_arr[i]){
                
                sum += min(left_max_arr[i],right_max_arr[i]) - height[i];
            }
        }
        
        return sum;
    }
};

时间复杂度O(n),空间复杂度O(n)
方法二：维护最小栈

class Solution {
public:
    int trap(vector<int>& height) {
        stack<int> min_stack;
        int current = 0, sum = 0;
        while(current < height.size()){
            while(!min_stack.empty() && height[current] > height[min_stack.top()]){
                int tmp = min_stack.top();
                min_stack.pop();
                if(min_stack.empty()) break;
                int length = current - min_stack.top() - 1;
                int h = min(height[min_stack.top()],height[current]) - height[tmp];
                sum += h*length;
            }
            min_stack.push(current++);
        }
        return sum;
    }
};