LeetCode_OJ【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!

这道题目标示的难度为hard，一开始确实不知道应该怎么做，后来看到了提示，用双指针法，想了半天才知道怎么做。

我们首先计算填满水之后的体积sum。使用两个指针，start指向数组首地址，end指向数组末尾，比较两个指针所指的数字，如果start指向的数字比较小，则加上start方向遍历到的最大值，然后start向后移一位，与此类似，对于end也是同样的处理，不过end需要向前移动。

下面是上述算法的JAVA实现。

public class Solution {
    public int trap(int[] height) {
    	int sum = 0,real = 0;
    	for(int start = 0,end = height.length-1,max_s = 0 ,max_e = 0;start <= end ; ){
    		if(height[start] <= height[end]){
    			if(height[start] > max_s){
    				max_s = height[start];
    			}
    			sum += max_s;
    			real += height[start];
    			start ++;
    		}
    		else{
    			if(height[end] > max_e){
    				max_e = height[end];
    			}
    			sum += max_e;
    			real += height[end];
    			end--;
    		}
    	}
        return sum - real;
    }
}