盛最多水的容器——LeetCode

这个题是用贪心算法:

代码:

    public int maxArea(int[] height) {
        int i = 0;
        int j = height.length - 1;
        int result = 0;
        while (i != j) {
            int min = Math.min(height[i], height[j]);
            result = Math.max(result, min * (j - i));
            if (min == height[i]) {
                i++;
            } else {
                j--;
            }
        }

        return result;
    }