Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit df65d35

Browse files
Added Python solution for 11.Container With Most Water (#134)
1 parent fa49b4a commit df65d35

File tree

1 file changed

+14
-0
lines changed
  • Algorithms/Medium/11_ContainerWithMostWater

1 file changed

+14
-0
lines changed
Lines changed: 14 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,14 @@
1+
class Solution:
2+
def maxArea(self, height: List[int]) -> int:
3+
max_area = 0
4+
a_pointer, b_pointer = 0, len(height) - 1
5+
6+
while a_pointer < b_pointer:
7+
if height[a_pointer] < height[b_pointer]:
8+
max_area = max(max_area, height[a_pointer] * (b_pointer - a_pointer))
9+
a_pointer += 1
10+
else:
11+
max_area = max(max_area, height[b_pointer] * (b_pointer - a_pointer))
12+
b_pointer -= 1
13+
14+
return max_area

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /