LeetCode 44: Trapping Rain Water

最新推荐文章于 2022-01-25 23:54:30 发布

huazi0204

最新推荐文章于 2022-01-25 23:54:30 发布

阅读量553

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/huazi0204/article/details/8826793

版权

LeetCode 专栏收录该内容

43 篇文章 0 订阅

订阅专栏

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!

LL's solution:

two pointer -> O(N)

public class Solution {
    public int trap(int[] A) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int len = A.length;
        if(len<3)
            return 0;
        int start = 0,end=len-1,res=0;
        int runner;
        while(start<end){
            if(A[start]<=A[end]){   // move start
                runner = start+1;
                while(A[runner]<=A[start] && runner<end){
                    res += A[start]-A[runner];
                    runner++;
                }
                start=runner;
            }
            else{   // move end
                runner = end-1;
                while(A[runner]<=A[end] && runner>start){
                    res += A[end]-A[runner];
                    runner--;
                }
                end=runner;                
            }
        }
        return res;
    }
}

Note:

1. 每次要移动start和end里面小的那个，这样才能保证runner走动时trap的water一定是valid的（能保证另一侧有closure）

2. 移动runner要注意不能超过另一侧，否则就out of range了