Container With Most Water

Loading...LeetCode

Problem

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

Pseudocode

- two pointers, starting at both ends, find largest rectangle
- move the poitner with the lowest height to find another that is taller

Solution

var maxArea = function (height) {
  let output = 0;
  let left = 0;
  let right = height.length - 1;

  while (left < right) {
    let width = right - left;

    // choose the max, either from output of product of min height * width
    output = Math.max(output, Math.min(height[left], height[right]) * width);

    if (height[left] <= height[right]) {
      left++;
    } else {
      right--;
    }
  }

  // console.log(output)
  return output;
};

Time and Space Complexity

Time

• What did the code do

• Total -

Space

• What did the code do

• Total -