.思路：首位兩個(gè)指針掷空，將短的一端指針向內(nèi)移動(dòng)
class Solution(object):
def maxArea(self, height):
"""
:type height: List[int]
:rtype: int
"""
l = 0
r = len(height)-1
res = (r-l)*min(height[l],height[r])
while l<r:
if height[l]>height[r]:
r-=1
else:
l+=1
cur = (r-l)*min(height[l],height[r])
res = max(cur,res)
return res
