题目:
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.
Example:
Input: [1,8,6,2,5,4,8,3,7]
Output: 49
解法一:
对所有的数进行不重复的的组队遍历,并写出一个函数,把每对数放进去计算出大小保存,直至所有的数遍历完成,则找到了最大值。
//穷举法,性能比较差。
public static int maxArea(int[] height) {
int sum = 0;
if (height.length == 1 || height.length ==0) return 0;
for (int i=0;i<height.length;i++){ //利用穷举法,计算海水的面积,计算出最大的值并保存下来。
for (int j=i+1;j<height.length;j++){
sum = Math.max(sum,calateSum(height,i,j));
}
}
return sum;
}
//计算两个数字之间的海水大小
public static int calateSum(int[] height,int a,int b){
return Math.min(height[a],height[b])*Math.abs(a-b);
}
解法二:
为了减少时间复杂度,则想到了设置两个指针,类似于快速排序,头指针和尾指针,计算两个指针之间的海水容纳量,并指针往对应数组值比较小的地方移动,两个指针逐渐汇合,直至相邻,计算结束。
public static int maxArea1(int[] height){
int maxArea=0;int l = 0; int r = height.length - 1;//定义左边界和右边界
while (l<r){
maxArea = Math.max(maxArea, Math.min(height[l],height[r])*(r-l));
if (height[l]<height[r]){
l++;
}else {
r--;
}
}
return maxArea;
}