LeetCode - Container With Most Water

Given n non-negative integers a₁, a₂, ..., a_n, where each represents a point at coordinate (i, a_i). n vertical lines are drawn such that the two endpoints of line i is at (i, a_i) 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.

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