class Solution {
    public int maxArea(int[] height) {
        int area=0, temp;
        int left=0, right=height.length-1;
        while(left<right){
            temp=(right-left)*Math.min(height[left], height[right]);
            area=Math.max(area, temp);
            if(height[left]>height[right]) {
                right--;
            } else if(height[left]<height[right]) {
                left++;
            } else {
                left++;
                right--;
            }
        }
        return area;
    }
}