[LeetCode_11] Container With Most Water(Python)

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

문제

---

코드

class Solution:
    def maxArea(self, height: List[int]) -> int:
        l, r = 0, len(height)-1
        ans = 0
        while l < r:
            dist = r - l
            ans = max(ans, dist * min(height[l], height[r]))

            if height[l] < height[r]:
                l += 1
            else:
                r -= 1
        return ans

---

Idea

dist = r - l
넓이 = dist x (min(height[l], height[r]))

-> 짧은 위치 += 1