[leetcode] day92 container with the most water

subject

11. Container for the most water 【 secondary 】

Answer key

Double pointer practice ： The double pointer starts on both sides , Calculate the water volume of the container at this time , If it is greater than max, Update max; Which side moves low after that , Move in the middle , Repeat the above steps to update max, Until all vertical lines are traversed

class Solution {
    
    public int maxArea(int[] height) {
    
        int l=0,r=height.length-1,max=0;
        while(l<r){
    
            int area=Math.min(height[l],height[r])*(r-l);
            max=Math.max(area,max);
            if(height[l]<height[r])
                l++;
            else
                r--;
        }
        return max;
    }
}

Time complexity ：$O(n)$

Spatial complexity ：$O(1)$