LeetCode刷题day042 (Jieky)

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
*/
import java.util.Arrays;
public class TrappingRainWater{
	public static void main(String[] args){
		TrappingRainWater trw = new TrappingRainWater();
		int[] nums = {0,1,0,2,1,0,1,3,2,1,2,1};
		int result = trw.trap(nums);
		System.out.println(result);
	}
	
	public int trap(int[] height) {
        if (height.length < 3) return 0;
        /*
        * 观察当前列两端最高的列的情况,，可以分为三种：
        * 1. 两边最高的都比当前高 有雨水
        * 2. 一遍比当前高，另一边比当前矮 无雨水
        * 3. 一遍比当前高，另一边和当前一样 无雨水
        * */

        /*
        * 动态规划:
        * 求出当前列左边最大值和右边最大值，
        * 求的过程中使用前面已经获得的结果。
        * */

        // 盲猜初始值都为0
        int[] leftMax = new int[height.length];
        int[] rightMax = new int[height.length];

        for (int i=1;i<height.length;i++){
            leftMax[i] = Math.max(height[i-1],leftMax[i-1]);
        }

        for(int j=height.length-2;j>0;j--){
            rightMax[j] = Math.max(height[j+1],rightMax[j+1]);
        }

        int sum = 0;
        for (int i=1;i<height.length-1;i++){

            if (height[i] < leftMax[i] && height[i] < rightMax[i]){
                int min = Math.min(leftMax[i],rightMax[i]);
                sum += min - height[i];
            }
        }

        return sum;
    }
	
	public int trap02(int[] height) {
        if (height.length < 3) return 0;
        /*
        * 观察当前列两端最高的列的情况,，可以分为三种：
        * 1. 两边最高的都比当前高 有雨水
        * 2. 一遍比当前高，另一边比当前矮 无雨水
        * 3. 一遍比当前高，另一边和当前一样 无雨水
        * */
        int sum = 0;
        for (int i=1;i<height.length-1;i++){
			// 这里为获取最大值重复比较了
            int leftMax = Arrays.stream(Arrays.copyOfRange(height,0,i)).max().getAsInt();
            int rigthMax = Arrays.stream(Arrays.copyOfRange(height,i+1,height.length)).max().getAsInt();
            if (height[i] < leftMax && height[i] < rigthMax){
                int min = Math.min(leftMax,rigthMax);
                sum += min - height[i];
            }
        }

        return sum;
    }
	
	public int trap01(int[] height) {
        if (height.length == 0) return 0;
        // 这个流是真的牛啊
        int max = Arrays.stream(height).max().getAsInt();
        // 一层一层的计算雨水
        int sum = 0;
        for(int i=1;i <= max;i++){
            boolean startCal = false;
            int temp = 0;
            for (int j=0;j < height.length;j++){
                if (height[j] >= i){
                    startCal = true;
                    sum += temp;
                    temp = 0;
                }
                if (startCal && height[j] < i){
                    temp++;
                }
            }
        }
        return sum;
    }
}