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

#include <chrono>
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param height int整型vector 
     * @return int整型
     */
    int maxArea(vector<int>& height) {
        // write code here
        int Area = 0; 
        int left = 0;
        int right = height.size() - 1;
        while (left < right) {
            int h = min(height[left], height[right]);
            Area = max(Area, h * (right - left));

            if(height[left] < height[right])
                left++;
            else
             right--;
        }

        return Area;
    }
};