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.
面积以两个点之间最小的长度作为高,当i<j的时候,只能i向后移动才能找到比现在面积更大的情况。
class Solution {
public:
int maxArea(vector<int> &height) {
int max = 0;
int i = 0;
int j = height.size() - 1;
if(j <= 0){
return 0;
}
while(i < j){
int area = min(height[i],height[j])*(j - i);
if(height[i] < height[j]){
i++;
}
else{
j--;
}
if(area > max){
max = area;
}
}
return max;
}
};