解题思路:两个指针分别为left和right指向两边,先计算容积然后看他们高度小的往里面走再算容积
class Solution {
public:
int maxArea(vector<int>& height) {
int left=0;
int right=height.size()-1;
//用来存放最大的容积
int ret=0;
while(left<right)
{
//先计算容积
int v=min(height[left],height[right])*(right-left);
if(height[right]<height[left])
{
right--;
}
else
{
left++;
}
ret=max(ret,v);
}
return ret;
}
};