Container With Most Water

Q:

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.

Note: You may not slant the container.

Solution:

public class Solution {
    public int maxArea(int[] height) {
        int i = 0;
        int j = height.length - 1;
        int area = 0;
        while (i < j) {
            int temp = Math.min(height[i], height[j]) * (j - i);
            area = Math.max(area, temp);
            if (height[i] < height[j]) {
                int left = height[i];
                while (i < j && height[i] <= left) {
                        i++;
                }
            }
            else {
                int right = height[j];
                while (i < j && height[j] <= right) {
                        j--;
                }
            }
        }
        return area;
    }
}