#42 Trapping Rain Water

Description

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

解题思路

• 设置了一个 map 用来存一对对的 wall
• 从0号位开始，依次往后寻找第一个比他大的 wall，这就说明这两个之间可以组成一对
• 那如果之后没有比他更高的wall了，就说明它现在是最高的，要靠别人来与他搭配，那就往后寻找第一个次高的墙，他俩组成一对，再重复第二步
• 直到配对的 wall 到达了最后一个index

class Solution {
    public int findFirstHeighestIndex(int start, int[] height){
        int i;
        int max = height[start + 1];
        int pos = start + 1;
        for(i = start + 1; i < height.length; i++){
            if(height[i] > max){
                max = height[i];
                pos = i;
            }
        }
        return pos;
    }
    public int getWater(int start, int end, int[] height){
        int i;
        int sum = 0;
        int heigest = height[start] < height[end]? height[start]: height[end];
        for(i = start + 1; i < end; i++){
            sum += heigest - height[i];
        }
        return sum;
    }
    public int trap(int[] height) {
        Map<Integer, Integer> pair = new HashMap<>();
        int i = 0;
        while(i < height.length && height[i] == 0)
            i++;
        int curr = i++;
        for(; i < height.length || curr < height.length - 1; i++){
            if(i == height.length){
                int temp = findFirstHeighestIndex(curr, height);
                pair.put(curr, temp);
                curr = temp;
                i = curr;
                continue;
            }
            if(height[curr] <= height[i]){
                pair.put(curr, i);
                curr = i;
            }
        }
        int sum = 0;
        for(int key: pair.keySet()){
            sum += getWater(key, pair.get(key), height);
        }
        return sum;
    }
}