11. 盛最多水的容器 Leetcode

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