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