- Notifications
You must be signed in to change notification settings - Fork 625
/
Copy path11.py
26 lines (20 loc) · 818 Bytes
/
11.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
'''
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.
'''
classSolution(object):
defmaxArea(self, height):
"""
:type height: List[int]
:rtype: int
"""
left, right, maxArea=0, len(height) -1, 0
whileleft<right:
maxArea=max(maxArea, min(height[left], height[right])*(right-left))
ifheight[left] <height[right]:
left+=1
else:
right-=1
returnmaxArea
# Space : O(1)
# Time: O(N)