Leecode11 盛水最多的容器 双指针法

class Solution {
    public int maxArea(int[] height) {
        int max=0;
        int width=height.length-1;
        int i=0;
        int j=height.length-1;
        while(i<j){
            int h;
            if(height[i]<=height[j]){
                h=height[i];
                i++;
            }else{
                h=height[j];
                j--;
            }
            if(h*width>max){
                max=h*width;
            }
            width--;
       }
        return max;
    }
}