用双指针夹逼准则
int maxArea(vector<int>& height) {
int i = 0;
int j = height.size() - 1;
int res = 0;
while (i < j) {
res = max(min(height[j], height[i]) * (j - i), res);
if (height[i] < height[j]) {
i++;
} else {
j--;
}
}
return res;
}