11. Container With Most Water

Given n non-negative integers a1, a2, …, an , where each represents a point at coordinate (i, ai). nvertical 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:

1
2

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

Code:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

class Solution(object):
    def maxArea(self,height):
        i = 0
        j = len(height) - 1
        max_area = 0

        while i < j:
            max_area = max(max_area,min(height[i],height[j])*(j-i))
            if height[i] < height[j]:
                i += 1
            elif height[i] > height[j]:
                j -= 1
            else:
                i += 1
                j -= 1
        return max_area

木桶原理：

• 面积= 行长度*两端低高度。

  行长度max=两端距离大

  两端低高度Max=两端低点相对最高

• 两端低点需要向高点移动至两端相邻