leetcode11:盛水最多的容器

class Solution {
public:
int maxArea(vector& height) {
int length = height.size();
int cur = 0;
int max = 0;
for (int i=0; i<length; i++){
for (int j=i+1; j<length; j++){
cur = height[i] > height[j]?height[j] * abs(i-j):height[i] * abs(i - j);
max = max>cur?max:cur;

        }
    }
    
    return max;
    
}

};