Container_With_Most_Water.js

/*
Container With Most Water
https://leetcode.com/problems/container-with-most-water/

You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).

Find two lines that together with the x-axis form a container, such that the container contains the most water.

Return the maximum amount of water a container can store.

Notice that you may not slant the container.

Example 1:
Input: height = [1,8,6,2,5,4,8,3,7]
Output: 49
Explanation: 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 2:

Input: height = [1,1]
Output: 1
*/

/**
 * @param {number[]} height
 * @return {number}
 */
var maxArea = function(height) {
  let left = 0;
  let right = height.length - 1;
  let maxArea = calculateArea(left, right, height);
  
  while(left < right) {
    if(height[left] < height[right]) {
      left++;
    } else {
      right--;
    }
    maxArea = Math.max(maxArea, calculateArea(left, right, height));   
  }
  return maxArea;
};

var calculateArea = function(x, y, height) {
  let minHeight = height[x] > height[y] ? height[y] : height[x];
  let width = y -x;
  return (width * minHeight);
};

module.exports.maxArea = maxArea;