LeetCode 11.盛最多水的容器 c++

#pragma region 11.盛最多水的容器
class Solution {
public:
    int maxArea(vector& height) {
        if (height.size() <= 1) return -1;
        int left = 0, right = height.size() - 1;
        int maxS = 0;
        while (left < right) {
            maxS = max(maxS, (min(height[left], height[right]) * (right - left)));
            height[left] < height[right] ? left++ : right--;
        }
        return maxS;
    }
};