LC 11. 盛最多水的容器

代码 :

class Solution {
public:
    int maxArea(vector<int>& height) {
        int res = 0;
        for(int l = 0, r = height.size() - 1; l < r; ) {
            int w = r - l;
            int h = min(height[l], height[r]);
            res = max(res, w * h);
            if(height[l] < height[r])
                l++;
            else 
                r--;
        }
        return res; 
    }
};