leetcode #11

【id】#11

【title】 Container With Most Water

【description】

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.

The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

【idea】

暴力搜索。便利list，依次计算面积，面积是（j-i)*min(height[i],height[j])
时间复杂度O（n^2）

【code】

class Solution:
    def maxArea(self, height):
        length = len(height)
        max_area = 0
        for i in range(length):
            for j in range(i+1, length):
                # print((height[i], height[j]))
                # print( (j-i)*min(height[i], height[j]) )
                max_area = max(max_area, (j-i)*min(height[i], height[j]))
        return max_area

【idea】

第一点是：面积取决于短板高度；第二点左边坐标越大面积可能越大。

利用两个指针right和left，初始化时分别是数组首尾，计算面积。寻找高度最高的线，如果左边高度小于右边高度，左边前移，left-=1；如果右边高度小于左边，右边后移，right +=1。

时间复杂度O（n）
空间复杂度O(1)

【code】

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

因为不想做10题哈哈哈哈哈哈 所以先11喽~~

算法小白希望 人间值得~