Leetcode Container With Most Water problem solution in Java

In the Leetcode Container With Most Water problem solution in Java programming, You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).

Find two lines that together with the x-axis form a container, such that the container contains the most water.

Return the maximum amount of water a container can store.

Leetcode Container With Most Water problem solution in Java programming

public class Solution {
public int maxArea(int[] height) {
    if(height.length<=1)return 0;
    
    int j=0;
    int k=height.length-1;
    
    int max = 0;
    
    while(k>j)
    {
        max =max>=(k-j)*min(height[k],height[j])?max:(k-j)*min(height[k],height[j]);
        
        if(height[k]>=height[j])
        {
            j++;
        }
        else
        {
            k--;
        }
    }
    return max;
}

public int min(int i,int j)
{
return i>=j?j:i;
}
}

Also read,

• Leetcode Container With Most Water problem solution in C++
• Leetcode Container With Most Water problem solution in C
• Leetcode Container With Most Water problem solution in Python
• Leetcode Container With Most Water problem solution in C#