11,盛最多水的容器

class Solution:
    def maxArea(self, height: List[int]) -> int:
        l = 0
        r = len(height)-1
        max_area = 0
        while l < r:
            tmp_area = min(height[l], height[r]) * (r-l)
            if tmp_area > max_area:
                max_area = tmp_area
            if height[l] < height[r]:
                l += 1
            else:
                r -= 1
        return max_area

猜你喜欢

转载自blog.csdn.net/weixin_42758299/article/details/88533618