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 Marcosfor contributing this image!

Example:

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

思路：

很简单嘛，两个指针，同时往中间走，每次l r 两个指针就比较， 谁比较小 ，小的(minh)先走，然后呢l就是往右走，每次都要加上与之前的高度差，而且高度要比minh小于等于，这样才能存起来嘛。

class Solution {
    public int trap(int[] height) {
        int l = 0;
        int r = height.length-1;
        int re=0;
        while(l < r){
            int minh = Math.min(height[l], height[r]);
            if(height[l] == minh){
                while(l< r &&   height[l] <= minh){
                    re+= minh - height[l];
                    l++;
                }
            }
            else{
                while(l< r && height[r]<= minh){
                    re += minh - height[r];
                    r--;
                }
            }
        }
        return re;
       
    }
}