public int maxArea(int[] height) {
int i=0,j=height.length-1;
int max=0;
while(i<j){
max=Math.max(max, Math.min(height[i], height[j])*(j-i));
if(height[i]>height[j])j--;
else i++;
}
return max;
}
leetcode11. Container With Most Water
最新推荐文章于 2024-07-14 14:55:48 发布