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

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param height int整型vector 
     * @return int整型
     */
    int maxArea(vector<int>& height) 
    {
        //利用单调性
        int left = 0;
        int right = height.size()-1;
        int max = 0,v = 0;
        while (left < right) 
        {
            v = (right - left) * (std::min(height[left],height[right]));
            max = std::max(max,v);
            if(height[left] < height[right])   ++left;
            else  --right;
        }
        return max;
    }
};