【Java】 【笔记】leetcode11. 盛最多水的容器

smakslow

//双指针法。存储水的多少取决于两端矮的柱子

[Java] 纯文本查看 复制代码

class Solution {
    public int maxArea(int[] height) {
        int max = -1;
        int left = 0;
        int right = height.length - 1;
        while(left < right){
            int minHeight = height[left] < height[right] ? height[left++] : height[right--];
            int area = (right - left + 1)*minHeight;
            max = Math.max(max,area);
        }
        return max;
    }
}

smakslow

领悟者的涂鸦笔 发表于 2021-3-19 15:48
[mw_shl_code=python,true]a=[1,8,6,2,5,4,8,3,7]
zuidazhi=0
for i in range(len(a)):

这种方式时间复杂度是O(n^2),可以优化