class Solution {
public:
int maxArea(vector<int>& height) {
int maxvol = 0;
int left = 0,right = height.size() - 1;
while(left < right)
{
int hei = 0;
if(height[left]<height[right])
{
hei = height[left];
left++;
}
else
{
hei = height[right];
right--;
}
maxvol = max(maxvol,hei*(right-left+1));
}
return maxvol;
}
};
力扣题解:盛最多水的容器
最新推荐文章于 2024-04-03 00:16:57 发布