11. Container With Most Water

作者: chaowwwww | 来源:发表于2018-04-11 09:14 被阅读0次

Leetcode11 Container With Most W
[LeetCode]11.盛最多水的容器
11. Container With Most Water
11. Container With Most Water
11. Container With Most Water
11. Container With Most Water
11. Container With Most Water
11. Container With Most Water
11. Container With Most Water
11. Container With Most Water

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

Leetcode11 Container With Most W
11. Container With Most Water Medium Given n non-negative...
[LeetCode]11.盛最多水的容器
11. Container With Most Water 问题描述 Given n non-negative i...
11. Container With Most Water
题目要求： Given n non-negative integers a1, a2, ..., an, wher...
11. Container With Most Water
11. Container With Most Water
Description Given n non-negative integers a1, a2, ..., an...
11. Container With Most Water
题目分析暴力实现即可，注意短板效应，还有何时移动边界。代码
11. Container With Most Water
题目描述： https://leetcode.com/problems/container-with-most-w...
11. Container With Most Water
左右指针夹逼，以最小高度为高，宽度(end-start)算出矩形面积，并和最大值比较，算出最大值。哪边高度矮就向中...
11. Container With Most Water
思路是首尾设置两个游标i,j。初始情况是宽度最宽，高度是height[i]和height[j]中较矮的一个。1.从...
11. Container With Most Water
题目 Given n non-negative integers a1, a2, ..., an, where e...