LeetCode 11. Container With Most Water（第八周）

题目：

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

Note: You may not slant the container and n is at least 2.

思路 & 代码：

找到容器最大值。

1)暴力查询：两层循环，i 从 0 开始，j 从 i + 1开始，每个状态算出容器面积，留下最大的面积，最后得到答案。

class Solution:
def maxArea(self, height):
maxa = 0 
n = len(height)
for i in range(n):
for j in range(i + 1, n):
width = min(height[i], height[j])
length = j - i
area = width * length
‘’‘print(width)
print(length)
print(area)’‘’
if area > maxa:
maxa = area
return maxa

sol = Solution()
height = [2, 3, 4, 5, 6, 7, 8, 5, 3, 6, 13]

print(sol.maxArea(height))

在网站上submit时发现超时。

2)两头向中间查询：一层循环，i 从 0 开始，j 从 n - 1 开始，i、j 中较小的一个往中间走一步，没个状态算出容器面积，留下最大面积。

class Solution:
def maxArea(self, height):
maxa = 0 
n = len(height)
i = 0
j = n - 1
while i != j:
width = min(height[i], height[j])
length = j - i
area = width * length
'''print(width)
print(length)
print(area)'''
if area > maxa:
maxa = area
if height[i] < height[j]:
i = i + 1
else:
j = j - 1
return maxa

sol = Solution()
height = [2, 3, 4, 5, 6, 7, 8, 5, 3, 6, 13]

print(sol.maxArea(height)) 

成功通过。