前言

大家好，我是毛毛。ヾ(´∀ ˋ)ﾉ
那就開始今天的解題吧~

Question

You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).

Find two lines that together with the x-axis form a container, such that the container contains the most water.

Return the maximum amount of water a container can store.

Notice that you may not slant the container.

Example 1:

Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

Example 2:

Input: height = [1,1]
Output: 1

Constraints:

• n == height.length
• 2 <= n <= 10^5
• 0 <= height[i] <= 10^4

Think

給一個陣列height，其中每個數字代表的是高度，我們要找出其中的兩個數字，兩個數字的高(小的那一個)，與兩個數字的index的距離相乘最大的(也就是面積)。

其實基本上跟前面Two Sum & 3Sum的作法是一樣的，從左右兩邊逼近來計算就可以了~

Code

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

        return max_contain    

Submission

今天就到這邊啦~
大家明天見