ArrayList: 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; int j = height.length -1; int best = Math.min(height[i],height[j])*(j-i); while(i<j){ int area = Math.min(height[i],height[j])*(j-i); if(area > best){ best = area; } if(height[i] < height[j]){//wrong here i++; } else{ j--; } } return best; } }

mistakes: when move from left to right, find line is higher than current left or right if(height[i] < height[j])