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

Example:

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

二 分析

  题目很短，hard级别。手机雨水问题主要看图就明白了。之前有过类似的题目 leetcode11:container-with-most-water

   使用了滑动窗口的方法。这个要复杂一些。还是这个思路：左右两个指针分别 指向头尾从两边向中间扫描，求出两边指针的较小值min，如果左边小从左往右扫，如果右边小，从右往左扫描。遇到的值比min小，则将差值存入结果.大于min则更新滑动指针位置（需要看图找规律)。

   代码如下：

public static void main(String[] args) {
		int[] nums= {0,1,0,2,1,0,1,3,2,1,2,1};
		System.out.println(trap(nums));

	}
	 //滑动窗口
	 public static int trap(int[] height) {
		 int res =0;
		 if(height== null|| height.length==1){
			 return res;
		 }
		 int l =0;
		 int r = height.length-1;

		 while(l<r){
			 int min = Math.min( height[l], height[r]);
			 if(min == height[l]){
				 l++;
				 while(l<r &&height[l]<min){//左侧比 左指针 小，计算面积
					 res  = res+ min-height[l++];
				 }				
			 }else{
			    r--;
			    while(l<r && height[r]<min ){//右侧比 右指针小，计算面积
			    	res = res+min-height[r--];
			    }
			 }			
		 }
		 		 
		return res;	        
	 }

https://www.cnblogs.com/grandyang/p/4402392.html  

还有更多解法。todo。