leetcode题目11. Container With Most Water

题目简介

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 line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

Note:

You may not slant the container and n is at least 2.

Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

CODE：

其实主要是判断左边和右边那个高度小，小的移动即可，因为大的移动会丢失大面积。

class Solution:
    def maxArea(self, height: List[int]) -> int:
        i = 0 
        j = len(height) - 1
        maxArea = 0
        while i<j:
            maxArea = max(maxArea, min(height[i], height[j]) * (j-i))
            if height[i] > height[j]: //哪个小，哪边移动缩进
                j -= 1
            else:
                i += 1
        return maxArea