leetcode-11-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.

Note: You may not slant the container and n is at least 2.

Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

class Solution {
    public static int maxArea(int[] height) {
        if (height == null || height.length == 0)
            return 0;
        int len = height.length;
        int low = 0, high = len - 1, maxArea = -1;
        while (low < high) {
            int currentArea = (high - low) * (Integer.min(height[low], height[high]));
            maxArea = Integer.max(maxArea, currentArea);
            if (height[low] <= height[high])
                low++;
            else
                high--;
        }
        return maxArea;
    }
}