2021-4-7-find the maximum water holding capacity

Container for the most water
Here you are. n Nonnegative integers a1,a2,…,an, Each number represents a point in the coordinate (i, ai) . Draw in coordinates n Bar vertical line , Vertical line i The two endpoints of are (i, ai) and (i, 0) . Find two of them , Make them x A container of shafts can hold the most water .

explain ： You can't tilt the container .

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