Trapping Rain Water_Leetcode_#42

LittleBob180

于 2016-09-13 11:29:07 发布

阅读量267

点赞数

分类专栏： Leetcode刷题笔记文章标签： leetcode

本文链接：https://blog.csdn.net/LittleBob180/article/details/52524424

版权

Leetcode刷题笔记专栏收录该内容

63 篇文章 0 订阅

订阅专栏

1 题目
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

2 解法

public class Solution {
    public int trap(int[] height) {
        int lhs = 0, rhs = height.length - 1; 
        int max = 0, maxLeft = 0, maxRight = 0;
        while(lhs < rhs){
            if(height[lhs] < height[rhs]){
                if(height[lhs] > maxLeft){
                    maxLeft = height[lhs];
                }else{
                    max += maxLeft - height[lhs];   
                }
                ++lhs;
            }else{
                if(height[rhs] > maxRight){
                    maxRight = height[rhs];
                }else{
                    max += maxRight - height[rhs];
                }
                --rhs;
            }
        }
        return max;
    }
}