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.
题意:给定n个正整数作为纵坐标,每个数在横坐标上相隔1,求构成的最大矩形
解题思路:最大矩形必然左右矩形纵坐标大于等于中心矩形的纵坐标
代码:
public class Solution {
public int maxArea(int[] height) {
if(height == null || height.length == 0){
return 0;
}
int max = 0;
int left = 0;
int right = height.length - 1;
while(left < right){
int temp = Math.min(height[left], height[right]) * (right - left);
if(temp > max){
max = temp;
}
if(height[left] < height[right]){
++left;
}else{
--right;
}
}
return max;
}
}