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