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.

For example,
Given [0,1,0,2,1,0,1,3,2,1,2,1], return 6.

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!

解析

题意：给予一个数组，每个数字代表一个宽为1的bar，求他们围起来能放入的水的容量
思路：我们可以一格一格的计算水容量，如计算i~j范围的水容量
用level代表i~j的最低水平面，如果height[i-1]小于height[i]，则i~j之间的level等于i，反之，水容量加上i-1确定的level-height[i]。

代码

int trap(vector<int>& height) {
    int l = 0, r = height.size()-1, level = 0, water = 0;
    while (l < r) {
        int lower = height[height[l] < height[r] ? l++ : r--];
        level = max(level, lower);
        water += level - lower;
    }
    return water;
}