42. Trapping Rain Water

阿新 • • 發佈：2017-09-24

turn blog length spa trapping cnblogs height water pub

class Solution {
    public int trap(int[] height) {
        int sum=0;
        int l=0;
        int r=height.length-1;
        int left=0;
        int right=0;
        while(l<=r)
        {
            if(left<=right)
            {
                if(height[l]>left)
                    left 
=height[l];
                else
                    sum+=left-height[l];
                l++;
            }
            else
            {
                if(height[r]>right)
                    right=height[r];
                else
                    sum+=right-height[r];
                r 
--;
            }
        }
        return sum;
    }
}

turn blog length spa trapping cnblogs height water pub class Solution { public int trap(int[] height) { int sum=0;

leetcode 42. Trapping Rain Water

pre lan pub after lin ret src esc problem link Given n non-negative integers representing an elevation map where the width of each bar is

42.trapping-rain-water

以前在聽演算法課的時候，有一個人說過這樣一句話，凡是那道題沒有思路的9成要用動態規劃，當然可能說的有點絕對，但是不無道理，就是說，一般的題目我們遇到後能立即想到思路，哪怕是那種很麻煩的，但是動態規劃往往是麻煩的也不一定能想出來。而動態規劃的難度也確實比較大，

#Leetcode# 42. Trapping Rain Water

https://leetcode.com/problems/trapping-rain-water/ Given n non-negative integers representing an elevation map where the width of each b

python leetcode 42. Trapping Rain Water

首先最左邊和最右邊肯定無法蓄水考慮能蓄水的情況：左右兩邊的高度都大於height[i] 所以得左右遍歷找到heigh[i]時的左右最大值再遍歷height 當min(maxL[i],maxR[i])>height[i]即能蓄水 class Solution: def t

[leetcode]42. Trapping Rain Water

我這個腦子哦，暴力和動態規劃都有點思路，然後就是想不全。想複雜了，一個一個高度減不就好了，我在那裡總面積減。下面幾種方法都是一個一個豎的小面積算的。 Solution 1:暴力解法時間複雜度o（n*n）空間複雜度o（1）從i往兩邊找最大 class Solution

LeetCode 題解：42. Trapping Rain Water

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute

leetcode-42-Trapping Rain Water

The intuition behind it is use stack to do it. Instead of compute the area vertical, we compute the area horizontal. I.e. Base on that, we us

LeetCode：42. Trapping Rain Water（能裝多少水問題）

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 afte

Leetcode 407. Trapping Rain Water II Leetcode 42. Trapping Rain Water

Problem: Given an m x n matrix of positive integers representing the height of each unit cell in a 2D elevation map, compute the volume of water

Leetcode 42 Trapping Rain Water

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 af

19.2.4 [LeetCode 42] Trapping Rain Water

continue pin water 沒有 tor open bar solution array Given n non-negative integers representing an elevation map where the width of each bar

*42. Trapping Rain Water 接雨水

rain 情況下 temp n-1 寬度最小 mar 當前位置 sel 1. 原始題目給定 n 個非負整數表示每個寬度為 1 的柱子的高度圖，計算按此排列的柱子，下雨之後能接多少雨水。上面是由數組 [0,1,0,2,1,0,1,3,2,1,2,1] 表示

42. 接雨水（Trapping rain water）

題目描述 LeetCode.cn地址：https://leetcode-cn.com/problems/trapping-rain-water/ LeetCode地址：https://leetcode.com/problems/trapping-rain-water/ 思路

LeetCode - 42、407 - Trapping Rain Water I - II

本文總結以下兩道題目： 42. Trapping Rain Water - 直方圖凹陷接雨水問題 (Hard) 407. Trapping Rain Water II - 上題二維變三維 (Hard) 42. Trapping Rain Water Gi

【python/Hard/42】Trapping Rain Water

題目實現思路模擬法。開闢一個數組leftMaxArr，leftMaxArr[i]為height[i]之前的最高的bar值，然後從後面開始遍歷，用rightMax來記錄從後向前遍歷遇到

【Lintcode】364.Trapping Rain Water II

example rom 中心 || als ref reat map href 題目： Given n x m non-negative integers representing an elevation map 2d where the area of each c

[LeetCode][Java] Trapping Rain Water

這就是 enter rgb code sdn mil net line repr 題意： Given n non-negative integers representing an elevation map where the width of each bar

LeetCode - Trapping Rain Water

size height ges tro turn idt ron href repr 題目描述： Given n non-negative integers representing an elevation map where the width of each bar

407. Trapping Rain Water II

如果 site rom image i++ less total blocks eat Given an m x n matrix of positive integers representing the height of each unit cell in a 2D

42. Trapping Rain Water

相關推薦