【LeetCode】42.Trapping Rain Water(Hard)解题报告

【LeetCode】42.Trapping Rain Water(Hard)解题报告

题目地址：https://leetcode.com/problems/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.

  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!

  中间的不管，只看相邻的。

Solution:

//time : O(n)
//space : O(1)
class Solution {
    public int trap(int[] height) {
        int left = 0;
        int right = height.length - 1;
        int res = 0;
        int leftMax = 0;
        int rightMax = 0;
        while(left < right){
            if(height[left] < height[right]){
                leftMax = Math.max(leftMax , height[left]);
                res += leftMax - height[left];
                left++;
            }else{
                rightMax = Math.max(rightMax , height[right]);
                res += rightMax - height[right];
                right--;
            }
        }
        return res;
    }
}

Date：2018年2月27日