class Solution {
public int maxArea(int[] height
) {
int l
=0;
int r
=height
.length
-1;
int res
=0;
while(l
<r
){
int area
=Math
.min(height
[l
],height
[r
])*(r
-l
);
if(area
>res
){
res
=area
;
}
if(height
[l
]<height
[r
]){
l
++;
}else{
r
--;
}
}
return res
;
}
}
转载请注明原文地址: https://mac.8miu.com/read-53133.html