42. Trapping Rain Water

最新推荐文章于 2018-05-17 10:57:38 发布
最新推荐文章于 2018-05-17 10:57:38 发布
阅读量101 收藏
点赞数
分类专栏： Leecode 亚马逊
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/bjzhaoxiao/article/details/80178173
版权

/* accetion of mine*/
class Solution {
public:
int trap(vector<int>& height) {
return help(0, height.size() - 1, height);
}


int help(int start,int end, vector<int>& height)
{
if (end- start<2) return 0;
int ans = 0;
int i = start;
int j = 0;
for (;i<=end;)
{
if (height[i] == 0) { i = i + 1;continue; };
j = i + 1;
if (j<=end && height[j]>height[i]) { i = i + 1;continue; };

while (j <=end && height[j] < height[i])
{
++j;
}
if (j > end) j = j - 1;
if (j - i <2) { i = i + 1; continue; };

if (j <= end && height[j] >= height[i])
{
for (int k = i;k <= j;k++)
{
//ans += height[k] - height[i] > 0 ? height[k] - height[i] : 0;
ans += height[i] - height[k] > 0 ? height[i] - height[k] : 0;
}
ans += help(j, end, height);
return ans;
}
//if (j - i == 2) { return abs(height[j] - height[j - 1]); };
if (j - i == 2) { return height[j] - height[j - 1]>0? height[j] - height[j - 1]:0; };

int max_value = INT_MIN;
int second_max_value = max_value;
int max_index = -1;
int seconde_max_index = -1;
for (int k = i;k <= j;k++)
{
if (height[k] > max_value) {
seconde_max_index = max_index;
second_max_value = max_value;

max_value = height[k];
max_index = k;
}
else
{
if (height[k] > second_max_value)
{
second_max_value = height[k];
seconde_max_index = k;
}
}
}
if (seconde_max_index == j)
{
for (int k = i+1;k <= seconde_max_index;k++)
{
ans += abs(height[seconde_max_index]- height[k]);
}
return ans;
}


return help(i, seconde_max_index, height) + help(seconde_max_index, end, height);
}
return ans;
}
};
// brute force
int trap(vector<int>& height)
{
    int ans = 0;
    int size = height.size();
    for (int i = 1; i < size - 1; i++) {
        int max_left = 0, max_right = 0;
        for (int j = i; j >= 0; j--) { //Search the left part for max bar size
            max_left = max(max_left, height[j]);
        }
        for (int j = i; j < size; j++) { //Search the right part for max bar size
            max_right = max(max_right, height[j]);
        }
        ans += min(max_left, max_right) - height[i];
    }
    return ans;
}


// dynamic Programming 
int trap(vector<int>& height)
{
if(height == null)
return 0;
    int ans = 0;
    int size = height.size();
    vector<int> left_max(size), right_max(size);
    left_max[0] = height[0];
    for (int i = 1; i < size; i++) {
        left_max[i] = max(height[i], left_max[i - 1]);
    }
    right_max[size - 1] = height[size - 1];
    for (int i = size - 2; i >= 0; i--) {
        right_max[i] = max(height[i], right_max[i + 1]);
    }
    for (int i = 1; i < size - 1; i++) {
        ans += min(left_max[i], right_max[i]) - height[i];
    }
    return ans;
}
/* others two Pointer*/
int trap(vector<int>& height)
{
    int left = 0, right = height.size() - 1;
    int ans = 0;
    int left_max = 0, right_max = 0;
    while (left < right) {
        if (height[left] < height[right]) {
            height[left] >= left_max ? (left_max = height[left]) : ans += (left_max - height[left]);
            ++left;
        }
        else {
            height[right] >= right_max ? (right_max = height[right]) : ans += (right_max - height[right]);
            --right;
        }
    }
    return ans;
}

/*

[4,2,3] is KO 0,should be 1
class Solution {
public:
int trap(vector<int>& height) {
if (height.size()<3) return 0;
int i = 0;
int j = 0;
int ans = 0;
for (i = 0; i<height.size()-1;)                   //in fact i<height.size()-2 is OK, because size()-3,size()-2,size()-1 can be three numbers;
{
if (height[i] == 0) { i = i + 1;continue; };
j = i + 1;
if (height[j]>height[i]) { i = i + 1;continue; };   // if not descrease continue;
//int start = i;
while (j<height.size() && height[j]<height[i]) { ++j; };  
if (j == height.size()) { i = i + 1; continue; };
//int end = j;
if (j - i<2) { i = i + 1; continue; };
for (int start = i + 1; start<j;start++)
{
ans += height[i] - height[start];
}
i = j;
}


return ans;
}
};
*/
/* [5,2,1,2,1,5] is KO 2, should be 14*/
/*
class Solution {
public:
int trap(vector<int>& height) {
if (height.size()<3) return 0;
int i = 0;
int j = 0;
int ans = 0;
for (i = 0; i<height.size()-1;)
{
if (height[i] == 0) { i = i + 1;continue; };
j = i + 1;
if (height[j]>height[i]) { i = i + 1;continue; };
while (j<height.size() && height[j]<height[j-1]) { ++j; };
if (j == height.size()) { i = i + 1; continue; };

while (j+1<height.size() && height[j + 1]>height[j]) { ++j; };
//if (j+1 == height.size()) { i = i + 1;continue; };
int start = i; 
int end = j;

if (end - start <2) { i = i + 1; continue; };
int max_use_height = height[start] > height[end] ? height[end] : height[start];

for (int k = start; k<=end;k++)
{
ans += (max_use_height- height[k])>0? max_use_height - height[k]:0;
}

i = j;
}


return ans;
}
};
*/
/*[5,4,1,2] 3 should be 1*/
/*
class Solution {
public:
int trap(vector<int>& height) {
if (height.size()<3) return 0;
int i = 0;
int j = 0;
int ans = 0;
for (i = 0; i<height.size() - 1;)
{
if (height[i] == 0) { i = i + 1;continue; };
j = i + 1;
if (height[j]>height[i]) { i = i + 1;continue; };

int max_used_value =height[j];
int max_used_index = j;


int start = i;
int end = j;
while (j < height.size() && (height[j]<height[i]))
{
if (height[j] > max_used_value)
{
max_used_index = j;
max_used_value = height[j];
}
++j;
}
//if (j == height.size()) { i = i + 1;continue; };
end = max_used_index + 1;
//if (height[j - 1] >= height[i])
if (j<height.size() && height[j] >= height[i])
{
max_used_index = i;
max_used_value = height[i];
end = j;
}


//if (j+1 == height.size()) { i = i + 1;continue; };



if (end - start <2) { i = i + 1; continue; };


for (int k = start; k <=end &&k<height.size();k++)
{
ans += (max_used_value - height[k])>0 ? max_used_value - height[k] : 0;
}


i = j;
}


return ans;
}
};
*/
/*[0,7,1,4,6] runtime error*/
/*
class Solution {
public:
int trap(vector<int>& height) {
return help(0, height.size() - 1, height);
}


int help(int start,int end, vector<int>& height)
{
if (end- start<2) return 0;
int ans = 0;
int i = start;
int j = 0;
for (;i<=end;)
{
if (height[i] == 0) { i = i + 1;continue; };
j = i + 1;
if (j<=end && height[j]>height[i]) { i = i + 1;continue; };

while (j <=end && height[j] < height[i])
{
++j;
}
if (j > end) j = j - 1;
if (j - i <2) { i = i + 1; continue; };

if (j <= end && height[j] >= height[i])
{
for (int k = i;k <= j;k++)
{
//ans += height[k] - height[i] > 0 ? height[k] - height[i] : 0;
ans += height[i] - height[k] > 0 ? height[i] - height[k] : 0;
}
ans += help(j, end, height);
return ans;
}
if (j - i == 2) { return abs(height[j] - height[j - 1]); };

int max_value = INT_MIN;
int second_max_value = max_value;
int max_index = -1;
int seconde_max_index = -1;
for (int k = i;k <= j;k++)
{
if (height[k] > max_value) {
seconde_max_index = max_index;
second_max_value = max_value;

max_value = height[k];
max_index = k;
}
else
{
if (height[k] > second_max_value)
{
second_max_value = height[k];
seconde_max_index = k;
}
}
}


return help(i, seconde_max_index, height) + help(seconde_max_index, end, height);
}
return ans;
}
};
*/


/* [4,4,4,7,1,0] output 1,shoudl be 0*/
/*
class Solution {
public:
int trap(vector<int>& height) {
return help(0, height.size() - 1, height);
}


int help(int start,int end, vector<int>& height)
{
if (end- start<2) return 0;
int ans = 0;
int i = start;
int j = 0;
for (;i<=end;)
{
if (height[i] == 0) { i = i + 1;continue; };
j = i + 1;
if (j<=end && height[j]>height[i]) { i = i + 1;continue; };

while (j <=end && height[j] < height[i])
{
++j;
}
if (j > end) j = j - 1;
if (j - i <2) { i = i + 1; continue; };

if (j <= end && height[j] >= height[i])
{
for (int k = i;k <= j;k++)
{
//ans += height[k] - height[i] > 0 ? height[k] - height[i] : 0;
ans += height[i] - height[k] > 0 ? height[i] - height[k] : 0;
}
ans += help(j, end, height);
return ans;
}
if (j - i == 2) { return abs(height[j] - height[j - 1]); };

int max_value = INT_MIN;
int second_max_value = max_value;
int max_index = -1;
int seconde_max_index = -1;
for (int k = i;k <= j;k++)
{
if (height[k] > max_value) {
seconde_max_index = max_index;
second_max_value = max_value;

max_value = height[k];
max_index = k;
}
else
{
if (height[k] > second_max_value)
{
second_max_value = height[k];
seconde_max_index = k;
}
}
}
if (seconde_max_index == j)
{
for (int k = i+1;k <= seconde_max_index;k++)
{
ans += abs(height[seconde_max_index]- height[k]);
}
return ans;
}


return help(i, seconde_max_index, height) + help(seconde_max_index, end, height);
}
return ans;
}
};
*/

bjzhaoxiao
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
711. Number of Distinct Islands II
bjzhaoxiao的专栏
05-14 608
// Acception of others// After we get coordinates for an island, compute all possible rotations/reflections (https://en.wikipedia.org/wiki/Dihedral_group) of it //and then sort them using the default ...
Leetcode 42. Trapping Rain Water
SnailTyan
02-07 236
文章作者：Tyan 博客：noahsnail.com  |  CSDN  |  简书 1. Description 2. Solution 解析：总的留存的雨水等于每个柱子上留存的雨水，而每个柱子上留存的雨水等于其左边最高柱子与右边最高柱子中较矮柱子的高度减去其高度。Version 1超时，Version 2是以空间换时间，Version 3是对Version 2的进一步优化。 Version 1 class Solution: def trap(sel
leetcode不会-3D-Trapping-Rain-Water-System:该repo包含复杂3D雨水收集系统的解决方案，该系统在Lee
06-30
leetcode 不会3D 捕集雨水系统 该 repo 包含复杂 3D 雨水收集系统的解决方案，该系统在 Leetcode Problem ...您必须编写一个函数来计算如果我们将无限供应的水倒在该建筑上时将存储在该建筑中的水量。...
lrucacheleetcode-leetcode:leetcode
06-29
Trapping Rain Water 85. Maximal Rectangle Monotonic stack for 2d array 239. Sliding Window Maximum 255. Verify Preorder Sequence in Binary Search Tree 907. Sum of Subarray Minimums 二叉搜索树 99. ...
leetcode卡-LeetCode:我的LeetCode解决方案
07-06
Trapping Rain Water II], BFS/Priority queue 2017.06.19 打卡[LeetCode 145. Binary Tree Postorder Traversal], Tree/stack 2017.06.20 打卡[LeetCode 107. Binary Tree Level Order Traversal II], Tree/BFS ...
leetcode答案-leetcode:leetcode.com问题的答案
06-30
leetcode 答案leetcode leetcode.com 问题的答案 跑步 python -m venv .venv source .venv/bin/activate pip install -r requirements.txt pytest <question>/tests.py ...lc42_trapping_rain_water/tests.py
leetcode1004-leetcode:leetcode删号重练个人记录:)
07-01
NEXT：42 Trapping Rain Water 刷题顺序 刷题内容总的来说包括数据结构、算法和技巧 按照tag分类别进行刷题，跳过like<200>like的题目 按Acceptance由高到低进行，每个tag所刷题目大于20(对于类型较少的题目大于5)，...
675. Cut Off Trees for Golf Event
bjzhaoxiao的专栏
05-11 192
/*Since we have to cut trees in order of their height, we first put trees (int[] {row, col, height}) into a priority queue and sort by height.Poll each tree from the queue and use BFS to find out step...
121. Best Time to Buy and Sell Stock
bjzhaoxiao的专栏
05-15 178
/*We need to find out the maximum difference (which will be the maximum profit) between two numbers in the given array. Also, the second number (selling price) must be larger than the first one (buyin...
126. Word Ladder II
bjzhaoxiao的专栏
05-14 166
//very interesting problem//It can be solved with standard BFS. The tricky idea is doing BFS of paths instead of words!//Then the queue becomes a queue of paths.class Solution {public: vector&lt;vecto...
819. Most Common Word
bjzhaoxiao的专栏
05-10 165
class Solution {public: string mostCommonWord(string paragraph, vector&lt;string&gt;&amp; banned) { string ret; map&lt;string, int&gt; mp; map&lt;string, int&gt; mp_ban; for (string s : banned) mp...
387. First Unique Character in a String
bjzhaoxiao的专栏
05-17 162
class Solution {public: int firstUniqChar(string s) { int idx = s.size(); map&lt;int, pair&lt;int, int&gt;&gt; mp; for (int i = 0; i &lt; s.size();i++) { mp[s[i]].first++; mp[s[i]].second = i; ...
235. Lowest Common Ancestor of a Binary Search Tree
bjzhaoxiao的专栏
05-17 161
/** * Definition for a binary tree node. * struct TreeNode { *     int val; *     TreeNode *left; *     TreeNode *right; *     TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; *//*Acception o...
682. Baseball Game
bjzhaoxiao的专栏
05-17 160
class Solution {public:    int calPoints(vector&lt;string&gt;&amp; ops) {        stack&lt;int&gt; s;        int ans = 0;        int num = 0;        for(int i = 0;i&lt;ops.size();i++)        {         ...
17 Letter Combinations of a Phone Number
bjzhaoxiao的专栏
05-17 147
/*String[] mapping = new String[] {"0", "1", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};*/class Solution {public:    vector&lt;string&amp
239. Sliding Window Maximum
bjzhaoxiao的专栏
05-17 143
/* Memory Limit Exceeded Jacob Given nums = [1,3,-1,-3,5,3,6,7], and k = 3. is OK*//*class Solution {public:    vector&lt;int&gt; maxSlidingWindow(vector&lt;int&gt;&amp; nums, int k) {                ...
545. Boundary of Binary Tree
bjzhaoxiao的专栏
05-11 135
/** * Definition for a binary tree node. * struct TreeNode { *     int val; *     TreeNode *left; *     TreeNode *right; *     TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; *//*1. One simp...
234 Palindrome Linked List
bjzhaoxiao的专栏
05-17 131
/** * Definition for singly-linked list. * struct ListNode { *     int val; *     ListNode *next; *     ListNode(int x) : val(x), next(NULL) {} * }; *//*//Time Limit Exceeded class Solution {public:  ...
请从.1. Anti reflection layer 2. Texturing (light trapping)两方面介绍一下Silicon Reflection
最新发布
06-03
Silicon Reflection通常被用于太阳能电池板的制造中，其具有减少反射和提高光吸收的特性。这主要得益于其具备以下两个方面的优势： 1. 抗反射层：Silicon Reflection通常在太阳能电池板的表面涂覆一层抗反射涂层，...

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值