### 问题描述

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

### 代码

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