zoukankan      html  css  js  c++  java
  • [LeetCode] Trapping Rain Water

    Note: The following idea is in fact from the last answer in this link, which leads to a clean code. I just reorganize it and add some explanations. I hope it is Ok.

    The following are four solutions in C/C++/Java/Python respectively. The basic idea is that we set two pointers l and r to the left and right end of height. Then we get the minimum height (minHeight) of these pointers (similar to Container with Most Water due to the Leaking Bucket Effect) since the level of the water cannot be higher than it. Then we move the two pointers towards the center. If the coming level is less than minHeight, then it will hold some water. Fill the water until we meet some "barrier" (with height larger than minHeight) and update l and r to repeat this process in a new interval.


    C

     1 int trap(int* height, int heightSize) {
     2     int l = 0, r = heightSize - 1, water = 0, minHeight = 0;
     3     while (l < r) { 
     4         while (l < r && height[l] <= minHeight)
     5             water += minHeight - height[l++];
     6         while (r > l && height[r] <= minHeight)
     7             water += minHeight - height[r--];
     8         minHeight = height[l] <= height[r] ? height[l] : height[r];
     9     }
    10     return water;
    11 }

    C++

     1 class Solution {
     2 public:
     3     int trap(vector<int>& height) {
     4         int n = height.size(), l = 0, r = n - 1, water = 0, minHeight = 0;
     5         while (l < r) {
     6             while (l < r && height[l] <= minHeight)
     7                 water += minHeight - height[l++];
     8             while (r > l && height[r] <= minHeight) 
     9                 water += minHeight - height[r--];
    10             minHeight = min(height[l], height[r]);
    11         }
    12         return water;
    13     }
    14 };

    Java

    public class Solution {
        public int trap(int[] height) {
            int n = height.length, l = 0, r = n - 1, water = 0, minHeight = 0;
            while (l < r) {
                while (l < r && height[l] <= minHeight)
                    water += minHeight - height[l++];
                while (r > l && height[r] <= minHeight)
                    water += minHeight - height[r--];
                minHeight = Math.min(height[l], height[r]);
            }
            return water;
        }
    }

    Python

     1 class Solution:
     2     # @param {integer[]} height
     3     # @return {integer} 
     4     def trap(self, height):
     5         n = len(height)
     6         l, r, water, minHeight = 0, n - 1, 0, 0
     7         while l < r:
     8             while l < r and height[l] <= minHeight:
     9                 water += minHeight - height[l]
    10                 l += 1
    11             while r > l and height[r] <= minHeight:
    12                 water += minHeight - height[r]
    13                 r -= 1
    14             minHeight = min(height[l], height[r])
    15         return water
  • 相关阅读:
    Web前端框架与类库的思考【转】
    mouseover事件mouseenter事件
    11_Eclipse中演示Git版本号的创建,历史版本号的改动,创建分支,合并历史版本号和当前版本号
    实现了私聊和群聊功能的聊天工具
    有预处理命令#define声明一个常数,用以表明1年中有多少秒
    解决Office软件冲突问题
    pig载入两个不同字段个数的文件?load file with different items(f1有42列,f2有43列读到一个对象中)
    游戏公司通用屏蔽字列表
    Android统计图表MPAndroidChart
    HTTP状态码解析
  • 原文地址:https://www.cnblogs.com/jcliBlogger/p/4646980.html
Copyright © 2011-2022 走看看