class Solution {
public:
    int maxArea(vector<int>& height) {
        int nums_size = height.size();
        int i = 0;
        int j = nums_size - 1;
        int max_w = 0;
        while(i < j){
            if (height[i] <= height[j]){

                max_w = max(max_w,height[i]*(j-i));
                i++;
            }else{
                max_w = max(max_w,height[j]*(j-i));
                j--;
            }
        }
        return max_w;
        
        

    }
};

谁短谁动