题目:
题解:
int max(int a, int b){
return a > b ? a : b;
}
int min(int a, int b){
return a < b ? a : b;
}
int maxArea(int* height, int heightSize) {
int l = 0, r = heightSize - 1;
int res = 0;
while(l < r){
int h = min(height[l], height[r]); //高度
res = max(res, h * (r - l));
if(height[l] < height[r]) l ++; //移动更矮的一端
else r --;
}
return res;
}