[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.

public class Solution {
    public int maxArea(int[] height) {
        if (height == null || height.length < 2) {
            return 0;
        }
        
        int l = 0;
        int r = height.length - 1;
        int max = 0;
        while (l < r)
        {
            int area = 0;
            if (height[l] > height[r]) {
                area = height[r] * (r - l);
                r--;
            } else {
                area = height[l] * (r - l);
                l++;
            }
            if (area > max) {
                max = area;
            }
        }
        
        return max;
    }
}