LeetCode # 11. Container With Most Water

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

Solution

class Solution:
  def maxArea(self, height: List[int]) -> int:
    max_area = 0
    left, right = 0, len(height) - 1
    while left < right:
      # do some logic here with left and right
      cur_area = min(height[left], height[right]) * (right - left)
      max_area = max(max_area, cur_area)
        
      if height[left] < height[right]:
        left += 1
      else:
        right -= 1
        
    return max_area

Last Updated on 2023/08/16 by A1go