Leetcode Container With Most Water Java Solution

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

Leetcode Container With Most Water Java Solution
The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

Example:

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

Solution:

class HackerHeap {
    public int maxArea(int[] height) {
        int start=0;
	    int end=height.length-1;
	    int max=0;
	for(int k=0;k<height.length-1;k++) {
		int res=0;
		int length=end-start;
		if(height[start]<height[end]) {
			res=height[start]*length;
			start++;
		}
		else {
			res=height[end]*length;
			end--;
		}
		max=Math.max(max, res);
	}
	return max;
    }
}