11. Container With Most Water.md

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

Resolution:

在list起始位置设置两个指针 i 和 j ，如果 a[i] < a[j]，则 i++， 否则 j++，直到两个指针相遇。

方法来源戳这里。

太机智了orz，自己推一下推导过程。

Code:

class Solution:
    def maxArea(self, height):
        """
        :type height: List[int]
        :rtype: int
        """
        result = 0
        i = 0
        j = len(height)-1
        while i < j:
            result = max(result, min(height[i], height[j])*(j-i))
            if height[i] < height[j]:
                i += 1
            else:
                j -= 1
        return int(result)