[Leetcode] 42. Trapping Rain Water
来源:互联网 发布:冰与火之歌第八季 知乎 编辑:程序博客网 时间:2024/06/10 07:32
好巧妙,双指针法,找到顶峰,左边开始数到最大,再从右边开始数到最大。
class Solution(object): def trap(self, height): """ :type height: List[int] :rtype: int """ if len(height)<=2: return 0 maxx = (0,-1) ans = 0 for i in range(0,len(height)): if height[i] > maxx[1]: maxx = (i,height[i]) curmax = height[0] for i in range(0,maxx[0]): if height[i] > curmax: curmax = height[i] else: ans += curmax - height[i] curmax = height[len(height)-1] for i in range(len(height)-1,maxx[0],-1): if height[i] > curmax: curmax = height[i] else: ans += curmax - height[i] return ans
0 0
- [LeetCode]42.Trapping Rain Water
- LeetCode --- 42. Trapping Rain Water
- LeetCode 42.Trapping Rain Water
- [Leetcode] 42. Trapping Rain Water
- [leetcode] 42.Trapping Rain Water
- 【leetcode】42. Trapping Rain Water
- ***LeetCode 42. Trapping Rain Water
- Leetcode 42. Trapping Rain Water
- leetcode 42. Trapping Rain Water
- [LeetCode]42. Trapping Rain Water
- leetcode 42. Trapping Rain Water
- LeetCode 42. Trapping Rain Water
- LeetCode 42. Trapping Rain Water
- LeetCode 42. Trapping Rain Water
- leetcode.42. Trapping Rain Water
- [leetcode] 42. Trapping Rain Water
- LeetCode-42.Trapping Rain Water
- LeetCode 42. Trapping Rain Water
- 探究MySQL的DML提交事务的意义和DQL是否有必要提交事务
- 云计算的那些事儿之计算虚拟化
- Ubuntu16.04.1如何安装TensorFlow1.1.0(CPU版)
- 17年4月15日嵌入式Linux C语言(一)
- 查验身份证
- [Leetcode] 42. Trapping Rain Water
- BZOJ 3224: Tyvj 1728 普通平衡树
- GPU&CPU频率和工作模式的获取设置
- 1.Django开发环境搭建
- Hdu 1513 Palindrome【思维+Lcs+滚动数组】
- C语言快排函数的实现
- pat 1124. Raffle for Weibo Followers
- 到底有多二
- java_界面