-
Notifications
You must be signed in to change notification settings - Fork 0
/
11-container_with_most_water.py
50 lines (38 loc) · 1.21 KB
/
11-container_with_most_water.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
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
"""
https://leetcode.com/problems/container-with-most-water/
You are given an integer array height of length n. There are
n vertical lines drawn such that the two endpoints of the
ith line are (i, 0) and (i, height[i]).
Find two lines that together with the x-axis form a container,
such that the container contains the most water.
Return the maximum amount of water a container can store.
Notice that you may not slant the container.
Example 1:
Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: The above vertical lines are represented by array
[1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue
section) the container can contain is 49.
Example 2:
Input: height = [1,1]
Output: 1
Constraints:
n == height.length
2 <= n <= 10^5
0 <= height[i] <= 10^4
"""
def maxArea(height: list[int]) -> int:
left = 0
right = len(height) - 1
maximumArea = 0
while left < right:
area = min(height[left], height[right]) * (right - left)
maximumArea = max(area, maximumArea)
if height[left] < height[right]:
left += 1
else:
right -= 1
return maximumArea
if __name__ == '__main__':
height = [1,8,6,2,5,4,8,3,7]
print(maxArea(height))