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