11. Container With Most Water - python3

Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of the line i is at (i, ai) and (i, 0). Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.

Notice that you may not slant the container.

My Answer 1: Time Limit Exceeded (48 / 56 test cases passed.)

class Solution:
    def maxArea(self, height: List[int]) -> int:
        maxarea = 0
        
        for i in range(0, len(height)):
            for j in range(i+1, len(height)):
                minheight = min(height[i], height[j])
                maxarea = max(maxarea, abs(i-j)*minheight)
                
        return maxarea

역시 이중 for 문이가 젤 먼저 등장~
모든 넓이 조합을 구해서 최댓값을 반환함

이게 java 로 솔루션에도 있는데 왜 타임리밋일까...

My Answer 2: Accepted (Runtime: 176 ms - 36.02% / Memory Usage: 16.5 MB - 53.05%)

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

그래서 반복문 하나만 쓰는 답을 참고해서 짜봤다^^
왼쪽 값이랑 오른쪽 값 중에 작은 값을 가진 애만 idx + 1

해피 뉴 이어~~