Leetcode11: 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.

public class Solution {
    public int maxArea(int[] height) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int i=0, j=height.length-1;
        int maxArea=0;
        while(i<j){
            int minH = Math.min(height[i], height[j]);
            int area = minH*(j-i);
            maxArea = Math.max(maxArea, area);
            
            if(height[i]<height[j]){
                i++;
                while(height[i]<minH) 
                    i++;
            }
            else{
                j--;
                while(height[j]<minH&&i<j)
                    j--;
            }
        }
        return maxArea;
    }
}