Container With Most Water

LeetCode Q 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.

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

Solution : Two pointers

area = height * width
height depends on the smallest height of left edge and right edge, i.e.
height = Math.min(height[left], height[right]).

Code:

public int triangleNumber(int[] nums) {
	
	int res = 0;

	int l = 0, r = nums.length - 1;

	while (l < r) {
		
		res = Math.max(res, Math.min(nums[l], nums[r] * (r - l + 1)));

		if (nums[l] > nums[r]) {
			r--;
		} else if (nums[l] < nums[r]) {
			l++;
		} else {
			l++; r--;
		}
	}

	return res;
}