class Solution {
public:
int maxArea(vector<int> &height) {
int l=0;
int r=height.size()-1;
int ret=0;
int area=0;
while(l<r)
{
area=min(height[r],height[l])*(r-l);
ret=max(ret,area);
if(height[l]<height[r])
l++;
else
r--;
}
return ret;
}
};
public:
int maxArea(vector<int> &height) {
int l=0;
int r=height.size()-1;
int ret=0;
int area=0;
while(l<r)
{
area=min(height[r],height[l])*(r-l);
ret=max(ret,area);
if(height[l]<height[r])
l++;
else
r--;
}
return ret;
}
};