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.
解题思路:从两端向中间遍历,以高度的增加来弥补长度的缩短,记录当前最大面积。
public class Solution {
public int maxArea(int[] height) {
int result=0;
int left=0;
int right=height.length-1;
if(right<1){
return 0;
}
while(left<right){
int area=Math.min(height[left],height[right])*(right-left);
if(area>result){
result=area;
}
if(height[left]<height[right]){
left++;
}else{
right--;
}
}
return result;
}
}