LeetCode / Container With Most Water

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

class Solution:
    def maxArea(self, height: List[int]) -> int:
        # Init vars
        max_area = 0
        start_index = 0
        end_index = len(height) - 1

        while start_index != end_index:
            # Get height
            start_height = height[start_index]
            end_height = height[end_index]

            # Find min height
            min_height = 0
            if start_height > end_height:
                min_height = end_height
            else:
                min_height = start_height
            
            # Get area and compare with max_area
            area = min_height * (end_index - start_index)
            if area > max_area:
                max_area = area

            # Move index of min height
            if start_height > end_height:
                end_index = end_index - 1
            else:
                start_index = start_index + 1
            
        return max_area