题目描述:Given n non-negative integers a1, a2, …, an , where each
represents a point at coordinate (i, ai). n vertical lines are drawn
such that the two endpoints of line i is at (i, ai) and (i, 0). Find
two lines, which together with x-axis forms a container, such that the
container contains the most water.Note: You may not slant the container and n is at least 2.
解题思路:
方法一:计算所有可能的容器大小,找出其中最大的那个。
时间复杂度:O(n²)
代码如下:
class Solution {
public int maxArea(int[] height) {
int max = 0;
for(int i=0;i<height.length-1;i++){
for(int j=i+1;j<height.length;j++){
int s = Math.min(height[i],height[j])*(j-i);
max=Math.max(s,max);
}
}
return max;
}
}
方法二:因为容量是由最短的线和两根线之间的距离决定的,指定初始的两个线为第一根线和最后一根线(距离最大),显然移动长线毫无意义。
时间复杂度:O(n)
代码如下:
class Solution {
public int maxArea(int[] height) {
int max=0;
int l=0,r=height.length-1;
while(l<r){
max=Math.max(max,Math.min(height[l],height[r])*(r-l));
if(height[l]<height[r]) l++;
else r--;
}
return max;
}
}