Container With Most Water
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.
这道题题目的就是读懂题意,容器的容水量就是横轴差*(较低的纵轴),用两重循环会导致超时,可以从双指针的方法,一个从头,一个从后。注意,其i已经是对x轴的一个排序,不用再排序了。
class Solution {
public:
int maxArea(vector<int> &height) {
int n=height.size();
int max=0;
int i=0,j=n-1;
while(i<j)
{
int kuan=j-i;
int gao= height[i]>height[j]?height[j]:height[i];
if(kuan*gao>max)
max=kuan*gao;
if(height[i]<height[j])
i++;
else
j--;
}
return max;
}
};