class Solution {
public:
    int maxArea(vector<int>& height) {
        int l = 0, r = height.size()-1;
        int ans = 0;
        while(l < r){
            int area = min(height[l],height[r])*(r-l);
            ans = max(ans, area);
            if(height[l] <= height[r]){//贪心，移动小的更优
                l++;
            }else{
                r--;
            }
        }
        return ans;
    }
};