这题记得思路,直接把以前的代码重构了以下,稍微容易读了一些。
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.
The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.
Example:
Input: [1,8,6,2,5,4,8,3,7] Output: 49
solution( o(n)复杂度)
public int maxArea(int[] height) {
int leftBorder=1,rightBorder=height.length;
int area=0;
while(leftBorder<rightBorder){
if(height[leftBorder-1]<=height[rightBorder-1]){
area=Math.max(area,(rightBorder-leftBorder)*Math.min(height[rightBorder-1],height[leftBorder-1]));
leftBorder++;
}else{
area=Math.max(area,(rightBorder-leftBorder)*Math.min(height[rightBorder-1],height[leftBorder-1]));
rightBorder--;
}
}
return area;
}