python第八周作业1：LeetCode 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.

这是一道数组的题目，在python下可以采用list来进行方便的实现。

一开始选择使用一个二重循环来遍历，时间复杂度为O(n^2)，出现了超时。

然后采用的算法是，同时从list的头和尾开始遍历，每次移动较短的边，并更新最大面积。直到表示头元素和尾元素的下标重合，退出循环，时间复杂度为O(n)

代码：

class Solution(object):
    def maxArea(self, height):
        """
        :type height: List[int]
        :rtype: int
        """
        maxarea = 0
        head = 0
        tail = len(height) - 1
        while head != tail:
            minside = min(height[head],height[tail])
            if maxarea < (tail-head)*minside:
                maxarea = (tail-head)*minside
            if height[head] < height[tail]:
                head += 1
            else:
                tail -= 1
        return maxarea