LeetCode 042 Trapping Rain Water
2016-05-26 00:34
435 查看
题目大意:通过一个一维数组给出一个地形截面图,要求下雨之后能蓄多少水。
例如:
Given [0,1,0,2,1,0,1,3,2,1,2,1], return 6.
思路:
先扫一遍找到最高的bar,然后从左往右扫一遍,遇到递增的bar说明无法蓄水,跳过,遇到递减的bar则加上高度差值,表示可以蓄这么多水(因为有最高的bar挡着,总可以蓄水的),直到遇到最高的bar。再从右往左扫一遍,同理。
例如:
Given [0,1,0,2,1,0,1,3,2,1,2,1], return 6.
思路:
先扫一遍找到最高的bar,然后从左往右扫一遍,遇到递增的bar说明无法蓄水,跳过,遇到递减的bar则加上高度差值,表示可以蓄这么多水(因为有最高的bar挡着,总可以蓄水的),直到遇到最高的bar。再从右往左扫一遍,同理。
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists(合并两个排好序的单链表);leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解