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.

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