题目描述:
一开始感觉这道题应该有简便算法的,但没想出来,就直接暴力做的:
class Solution {
public:
int maxArea(vector<int>& height) {
int n = height.size();
if(n == 2){
if(height[0] > height[1]){
return height[1];
}
else{
return height[0];
}
}
int res = 0,templeft,tempright,i;
for(i = 0;i < n;i++){
templeft = 0;
tempright = n - 1;
while(templeft <= i && height[i] > height[templeft]){
templeft++;
}
while(tempright >= i && height[tempright] < height[i]){
tempright--;
}
if((tempright - templeft) * height[i] > res){
res = (tempright - templeft) * height[i];
}
}
return res;
}
};
时间复杂度为o(n方),严重超时:
然后参考了别人的做法,还是自己太弱,其实思路也挺直观的:设立两个指针分别指向头和尾,显然初始时容器长度达到最大,然后从两头往中间搜索,在搜索过程中由于容器长度不断缩短,要尽可能保持高度最大,代码如下(参考):
class Solution {
public:
int maxArea(vector<int>& height) {
int l=0,r=height.size()-1;
int area = 0;
while(l<r){
int m = min(height[l],height[r]);
area = max(area,(r-l)*m);
if(height[l] == m)
++l;
else
--r;
}
return area;
}
};