题解 | #盛水最多的容器#

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