Leetcode-11.盛最多水的容器

1. 题目描述

2. 暴力解法

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

3. 双指针解法

    public int maxArea(int[] height) { 
        int max = 0;
        for(int i = 0,j = height.length -1; i<j;){
            int minHight = height[i] < height[j] ? height[i++]:height[j--];
            int area = (j-i+1) * minHight;
            max = Math.max(max,area);
        }
        return max;
    }