思路:
1 从俩端向中间走,每次放弃高度较小的
代码:
int maxArea(vector<int> &height) {
int result=0;
int left=0;
int right=height.size()-1;
while(left<right){
result=max(result,(right-left)*min(height[left],height[right]));
height[left]>height[right]?right--:left++;
}
return result;
}