leetcode Trapping Rain Water
2015-10-28 12:46
411 查看
class Solution(object): def trap(self, height): """ :type height: List[int] :rtype: int """ r = 0 begin =0 end = len(height)-1 while (begin<end): left,right = begin+1,end-1 hl = height[begin] hr = height[end] if hl<=hr: while(height[left]<hl): r+=hl-height[left] left+=1 while left<len(height)-1 and height[left+1]>=height[left]: left+=1 begin = left left+=1 else: while height[right]<hr: r+=hr-height[right] right-=1 while right>0 and height[right-1]>=height[right]: right-=1 end = right right-=1 return r
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- [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 题解
- LeetCode [Day 5] Longest Palindromic Substring 题解