class Solution {
public:
int maxArea(vector<int>& height) {
int l = height.size();
int i = 0, j = l-1;
int mx = 0;
while(i < j)
{
mx = max(mx, min(height[i], height[j]) * (j - i));
height[i] < height[j] ? i++ : j--;
}
return mx;
}
};
public:
int maxArea(vector<int>& height) {
int l = height.size();
int i = 0, j = l-1;
int mx = 0;
while(i < j)
{
mx = max(mx, min(height[i], height[j]) * (j - i));
height[i] < height[j] ? i++ : j--;
}
return mx;
}
};