leetcode/solution/11_Container_With_Most_Water.py at master · CodexploreRepo/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
class Solution:
    def maxArea(self, height: List[int]) -> int:
        left, right, max_vol = 0, len(height)-1, 0
        while(left < right):
            if height[left] > height[right]:
                vol = height[right]*(right - left)
                right-= 1
            else:
                vol = height[left]*(right - left)
                left += 1
            max_vol = max(max_vol, vol)
        return max_vol