Leetcode || Container With Most Water

Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

public int maxArea(int[] height) {
int max_water = 0;
for(int i=0; i<height.length; i++) {
for(int j=height.length-1; j>i; j--) {
max_water = Math.max(max_water, (j-i)*Math.min(height[i], height[j]));
}
}
return max_water;
}

for循环稍微改进了下还是超时

public int maxArea(int[] height) {
int i = 0;
int j = height.length - 1;
int max_water = 0;

while(i < j) {
max_water = Math.max(max_water, (j-i)*Math.min(height[i], height[j]));
if(height[i] < height[j])
i++;
else
j--;
}
return max_water;
}