LeetCode: 11. Container With Most Water

Greedy하게...

 

class Solution:
    def maxArea(self, height: List[int]) -> int:
        max_Area = 0
        l = 0
        r = len(height) - 1
        while l < r:
            w = r - l
            h = min(height[l], height[r])
            max_Area = max(max_Area,w*h)
            if height[l] < height[r]:
                for next_l in range(l+1, len(height)):
                    if height[next_l] > height[l]:
                        l = next_l
                        break
                if next_l == len(height) - 1:
                    break
            else:
                for next_r in range(r-1, -1, -1):
                    if height[next_r] > height[r]:
                        r = next_r
                        break
                if next_r == 0:
                    break
        return max_Area