Trapping Rain Water
来源:互联网 发布:瑜伽教学软件 编辑:程序博客网 时间:2024/06/09 22:51
当中要设定smaller,用此去不断地和比其小的值相减,就可以得到面积。
当中自己怀疑,一边会漏的情况,但事实上,我们判断选择时就选了最低的一边,而且是从两边向中间逼近的。可以放心
/**
* @param heights: an array of integers* @return: a integer
*/
public int trapRainWater(int[] heights) {
// write your code here
if (heights == null || heights.length < 3) {
return 0;
}
int start = 0, end = heights.length - 1;
int area = 0, smaller = 0;
while (start < end) {
if (heights[start] < heights[end]) {
smaller = heights[start];
while (start < end && heights[start] <= smaller) {
area = area + smaller - heights[start];
start++;
}
} else {
smaller = heights[end];
while (start < end && heights[end] <= smaller) {
area = area + smaller - heights[end];
end--;
}
}
}
return area;
}
0 0
- LeetCode: Trapping Rain Water
- LeetCode : Trapping Rain Water
- Trapping Rain Water
- [LeetCode] Trapping Rain Water
- [Leetcode] Trapping Rain Water
- [Leetcode] Trapping Rain Water
- Trapping Rain Water
- Trapping Rain Water
- [LeetCode]Trapping Rain Water
- Trapping Rain Water
- Trapping Rain Water
- LeetCode-Trapping Rain Water
- Trapping Rain Water
- [leetcode] Trapping Rain Water
- Trapping Rain Water
- [LeetCode] Trapping rain water
- Leetcode: Trapping Rain Water
- 38 - Trapping Rain Water
- java的泛型原理
- 文章标题
- 电脑管家杀毒显示组件破坏解决方法
- 一起talk C栗子吧(第一百五十六回:C语言实例--基于AF_UNIX域的流套接字通信)
- 委托和方法
- Trapping Rain Water
- 旋转字符串
- opencv官方样例学习笔记——introduction_to_svm
- 一线工程师转管理
- java杂记
- 【操作系统】重点知识点总结
- UVa 548
- leetcode 102 Binary Tree Level Order Traversal C++
- 练习三 Problem F