LeetCode 42 接雨水

// 找到最高的,分别从两边逼近...



class Solution {
    public int trap(int[] height){

        if (height.length <= 2) return 0;

        int index = 0;
        int max = 0;
        
        for (int i = 0;i < height.length; i ++){
            if (height[i] > max){
                max = height[i];
                index = i;
            }
        }

        int res = 0;
        int left = height[0];

        for (int i = 1;i < index; i ++){
            if (left > height[i]){
                res += left - height[i];
            }else left = height[i];
        }

        int right = height[height.length - 1];
        for (int i = height.length - 2; i > index ; i--){
            if (right > height[i])
                res += right - height[i];
            else right = height[i];
        }
        return res;
    }
}