11. Container With Most Water
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.
1、暴力解法
class Solution {
public int maxArea(int[] height) {
int max=0;
for(int i=1;i<height.length;i++) {
for(int j=0;j+i<height.length;j++) {
int area=i*Math.min(height[j], height[i+j]);
if(area>max)
max=area;
}
}
return max;
}
}
2、两个相近,时间复杂度为O(n)
class Solution {
public int maxArea(int[] height) {
int max=0,i=0,j=height.length-1;
while(i<j){
int area=(j-i)*Math.min(height[j], height[i]);
if(area>max)
max=area;
if(height[i]<height[j])
i++;
else
j--;
}
return max;
}
}