LeeCode 42 暴力

题意

传送门 LeeCode 42. 接雨水

题解

从左向右扫描最右侧的高于当前柱子的柱子，计算右侧柱子不低于左侧柱子的可蓄水量，此时在某个峰值之前，每个蓄水池的右侧高度是非递减的；从右向左扫描至前一次扫描得到的峰值位置，计算该区间左侧柱子不低于右侧柱子的蓄水量。

class Solution {
public:
    int trap(vector<int>& height) {
        int n = height.size();
        if(n <= 2) return 0;
        int sum = 0;
        int lb = 0, ub = 1;
        while(ub < n){
            while(ub < n && height[ub] < height[lb]) ub++;
            if(ub == n) {
                break;
            }
            int tmp = 0;
            for(int i = lb; i <= ub; i++) tmp += min(height[lb], height[i]);
            sum += (ub - lb + 1) * height[lb] - tmp;
            lb = ub, ub = lb + 1;
        }
        int h = lb; // 峰值
        lb = n - 2, ub = n - 1;
        while(lb >= h){
            while(lb >= h && height[ub] > height[lb]) lb--;
            if(lb == -1){
                break;
            }
            int tmp = 0;
            for(int i = lb; i <= ub; i++) tmp += min(height[ub], height[i]);
            sum += (ub - lb + 1) * height[ub] - tmp;
            ub = lb, lb = ub - 1;
        }

        return sum;
    }
};