Leetcode-Container With Most Water

Given n non-negative integers a₁, a₂, ..., a_n, where each represents a point at coordinate (i, a_i). n vertical lines are drawn such that the two endpoints of line i is at (i, a_i) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

Note: You may not slant the container.

Analysis:

Solution:

public class Solution {
    public int maxArea(int[] height) {
        int max = 0;
        int head = 0;
        int end = height.length-1;
       
        while (head<end){
            int left = height[head];
            int right = height[end];
            int vol = (end-head)*Math.min(left,right);
            if (vol>max) max = vol;

            if (left<=right)
                while (head<end && left>=height[head]) head++;
            else 
                while (head< end && right>=height[end]) end--;
        }
        
        return max;   
        
    }
}