leetcode: Contain With Most Water

class Solution {
    public static int maxArea(int[] height) {
		int left = 0;
		int right = height.length - 1;
		int max = calcArea(left, right, height);

		while (left != right) {
			if (height[left] < height[right]) {
				left++;
			} else {
				right--;
			}

			max = Math.max(max, calcArea(left, right, height));
		}
		return max;
	}

	public static int calcArea(int left, int right, int[] height) {
		return (right - left) * Math.min(height[left], height[right]);
	}
}