class Solution {
public:
int maxArea(vector<int>& height)
{
const int n=height.size();
int leftWall=height[0];
int rightWall=height[n-1];
int left=0;
int right=n-1;
int size=0;
while(left<right)
{
size=max(size,min(leftWall,rightWall)*(right-left));
if(leftWall<rightWall)
{
++left;
leftWall=height[left];
}
else
{
--right;
rightWall=height[right];
}
}
return size;
}
};
Container With Most Water
最新推荐文章于 2019-03-03 21:11:47 发布