class Solution {
public int maxArea(int[] height) {
int i = 0, j = height.length - 1;
int carry = 0;
while (i < j) {
carry = Math.min(height[i], height[j]) * (j - i) > carry ? Math.min(height[i], height[j]) * (j - i) : carry;
if (height[i] < height[j]) {
i++;
} else {
j--;
}
}
return carry;
}
}
LeetCode-11:盛最多水的容器(Java语言实现)
最新推荐文章于 2024-06-12 10:00:23 发布