Java for LeetCode 042 Trapping Rain Water
2015-05-11 23:22
537 查看
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
解题思路:
先找到第一块最高的木板,然后从前向最高木板遍历,接着从后向最高木板遍历,JAVA实现如下:
For example,
Given
[0,1,0,2,1,0,1,3,2,1,2,1], return
6.
解题思路:
先找到第一块最高的木板,然后从前向最高木板遍历,接着从后向最高木板遍历,JAVA实现如下:
static public int trap(int[] height) { int result=0,peak=0,firstMax=0; for(int i=0;i<height.length;i++) if(height[i]>height[firstMax]) firstMax=i; for(int i=0;i<firstMax;i++) if(height[i]>height[peak]) peak=i; else result+=height[peak]-height[i]; peak=height.length-1; for(int i=height.length-1;i>firstMax;i--) if(height[i]>height[peak]) peak=i; else result+=height[peak]-height[i]; return result; }
相关文章推荐
- LeetCode 042 Trapping Rain Water
- [LeetCode]题解(python):042-Trapping Rain Water
- LeetCode 第四十二题(Trapping Rain Water) Java
- [LeetCode]042-Trapping Rain Water
- [leetcode-42]Trapping Rain Water(java)
- [LeetCode][Java] Trapping Rain Water
- LeetCode : Trapping Rain Water (java)
- [Leetcode] Trapping Rain Water (Java)
- [LeetCode][Java] Trapping Rain Water
- leetcode-042:Trapping Rain Water
- LeetCode 042 Trapping Rain Water
- Trapping Rain Water leetcode java
- LeetCode 407. Trapping Rain Water II
- leetcode question 42: Trapping Rain Water
- Leetcode-Trapping Rain Water
- [LeetCode] Trapping Rain Water 栈
- [LeetCode] Trapping Rain Water 解题报告
- LeetCode:Trapping Rain Water
- Leetcode 42 Trapping Rain Water
- Trapping Rain Water--LeetCode