Container With Most Water

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.


strategy
1. the area of container should be the height = min(ai, aj) times the distance between two point at x-axis
2. using for loop to search for the two point in the range between 1 and n


public class Solution {
    public 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;
    }
}