classSolution{publicintmaxArea(int[] height){int left =0;int right = height.length -1;int area =0;int cur;// 前后指针while(left < right){if(height[left]<= height[right]){
cur =(right - left)* height[left];// 计算当前的面积}else{
cur =(right - left)* height[right];// 计算当前的面积}
area = cur > area ? cur : area;// 指针移动的目的是寻找更大的height[i]if(height[left]< height[right]){
left++;}else{
right--;}}return area;}}