LeetCode算法题目011 : 盛最多水的容器

 public static int maxArea(int[] height) {
        Integer maxArea = 0;
        for (int i = 0; i < height.length; i++) {
            for (int j = i + 1; j < height.length; j++) {
                maxArea = Math.max((j - i) * (Math.min(height[i], height[j])),maxArea);
            }
        }
        return maxArea;
    }

public static int maxArea(int[] height) {
        if (height.length <= 1) {
            return 0;
        }
        int i = 0;
        int j = height.length - 1;
        int sum = 0;
        while (i < j) {
            int minHeight = Math.min(height[i], height[j]);
            sum = (sum > minHeight * (j - i)) ? sum : minHeight * (j - i);
            if (height[i] > height[j]) {
                j--;
            } else {
                i++;
            }
        }
        return sum;
    }