class Solution {
public:
int maxArea(vector<int>& height) {
int left = 0;
int right = height.size() - 1;
int rtn = 0;
while (left < right){
rtn = max(rtn, min(height[left], height[right]) * (right - left));
if (height[left] < height[right]){
int temp = height[left];
while(left < right){
if (height[left] > temp){
break;
}
left ++;
}
}else{
int temp = height[right];
while(left < right){
if (height[right] > temp){
break;
}
right --;
}
}
}
return rtn;
}
};
简单的一维问题空间用双指针搜素很好,就是需要注意双指针更新的条件