python學習第8周（3）： 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.

 

題解：

class Solution:

    def maxArea(self, height):
        """
        :type height: List[int]
        :rtype: int
        """
        l = 0
        r = len(height) - 1
        ans = 0
        while l < r:
            ans = max(ans, (r - l) * min(height[r], height[l]))
            if height[l] > height[r]:
                r -= 1
            else:
                l += 1
        return ans

我們知道短的那一條邊決定了木桶的高度，因此若一個木桶中包含有更大的木桶，則這個更大的木桶肯定不包含外圍的木桶中較短的那一條邊。從這一題說，若l，r之間有更大的木桶，則l，r中高度較小的那個肯定不屬於這個更大的木桶