题目描述:
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.
题目大意:
输入一个权威正数的列表,列表中每一项的索引代表横坐标,该项值代表纵坐标,每个点与横坐标与其相同纵坐标为0构成一条线段,从这些线段中找到一个能包含最大面积的容器(容器的高视两条线段的最短边),最终返回最大面积。比如输入[1, 2, 1],那么分别有线段(0,0)到(0,1)、(1,2)到(1,0)、(2,1)到(2,0),最大面积应该为(2 - 0) * 1 = 2。
思路:
如果当前两条线段长度不同,那么只有可能将较短那条线段换作更长的线段,面积才可能更大
AC代码:
class Solution(object):
def maxArea(self, height):
"""
:type height: List[int]
:rtype: int
"""
maxA = (len(height) - 1) * min(height[0], height[-1])
l, r = 0, len(height) - 1
while l < r:
if height[l] < height[r]:
l += 1
elif height[l] > height[r]:
r -= 1
else:
l += 1
r -= 1
if ((r - l) * min(height[l], height[r])) > maxA:
maxA = (r - l) * min(height[l], height[r])
return maxA