力扣每日一题【盛最多水的容器】

题目链接 .
b站视频链接.

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