Leetcode-container with most water

Given n non-negative integers A1, A2, ..., an, where each represents a point at Coordi Nate (i, ai). N Vertical Lines is drawn such that the the both endpoints of line I am at (i, ai) and ( i, 0). Find 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:

1  Public classSolution {2      Public intMaxarea (int[] height) {3         intMax = 0;4         intHead = 0;5         intEnd = Height.length-1;6        7          while(head<end) {8             intleft =Height[head];9             intright =Height[end];Ten             intvol = (end-head) *math.min (left,right); One             if(vol>max) max =Vol; A  -             if(left<=Right ) -                  while(Head<end && Left>=height[head]) head++; the             Else  -                  while(head< end && Right>=height[end]) end--; -         } -          +         returnMax;  -          +     } A}

Leetcode-container with most water