class Solution {
public int maxArea(int[] height) {
int left=0;
int right=height.length-1;
int docker=0;
while(left<right){
int area=(right-left)*Math.min(height[left],height[right]);
int minH=Math.min(height[left],height[right]);
docker=Math.max(area,docker);
//固定一方的长度
while(height[left]<=minH && left<right){
left++;
}
while(height[right]<=minH && left<right){
right--;
}
}
return docker;
}
}