Trapping Rain Water - LeetCode
题目:
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 [0,1,0,2,1,0,1,3,2,1,2,1]
, return 6
.
我想的办法其实比较暴力,我先从左开始循环数组,记录下当前的最大高度mi。当当前值小于mi时,我们将该值加入栈内;当当前值大于mi时,我们计算目前栈内的盛水量,并且将栈清空只放该值。但是这样面对上面的例子时,我们会发现最后的那部分不会被记录,所以我们从右开始重复上面的过程,而计算的盛水量与上面对应位置的盛水量相加,最后选择盛水量数组里面最大的输出。其实别人的解法也有一些更简单的,我只是感觉我的方法比较好理解。
代码:
class Solution:
# @param A, a list of integers
# @return an integer
def trap(self, A):
if not A:
return 0
res ,res1 =0, 0
stack ,stack1 =[], []
mi,mi1 = A[0], A[-1]
size = len(A)
temp = [0]*size
for i in xrange(size):
stack.append(A[i])
if A[i] >= mi:
res += calarea(stack)
stack = [A[i]]
mi= max(mi,A[i])
temp[i] += res
stack1.append(A[size-i-1])
if A[size-i-1] >= mi1:
res1 += calarea(stack1)
stack1 = [A[size-i-1]]
mi1= max(mi1,A[size-i-1])
temp[size-i-1] += res1
return max(temp)
def calarea(stack):
if len(stack) < 3:
return 0
res = 0
count = 0
minitem =min(stack[0],stack[-1])
for i in stack[1:-1]:
if i<minitem:
res += i
count += 1
return minitem*count - res