11.Container-With-Most-Water.md

11. Container With Most Water

Difficulty: Medium

URL

https://leetcode.com/problems/container-with-most-water/

Solution

Approach 1: Double Pointer

class Solution:
    def maxArea(self, height: List[int]) -> int:
        left = 0
        right = len(height) - 1
        max_volumn = 0
        while left < right:
            cur_volumn = min(height[left], height[right]) * (right - left)
            max_volumn = max(max_volumn, cur_volumn)
            if height[left] < height[right]:
                left += 1
            else:
                right -= 1
        return max_volumn