题目:
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.
题解:
class Solution:
def maxArea(self, height):
"""
:type height: List[int]
:rtype: int
"""
l = 0
r = len(height) - 1
ans = 0
while l < r:
ans = max(ans, (r - l) * min(height[r], height[l]))
if height[l] > height[r]:
r -= 1
else:
l += 1
return ans
我们知道短的那一条边决定了木桶的高度,因此若一个木桶中包含有更大的木桶,则这个更大的木桶肯定不包含外围的木桶中较短的那一条边。从这一题说,若l,r之间有更大的木桶,则l,r中高度较小的那个肯定不属于这个更大的木桶