[M] 11. 裝最多水的容器 (Container With Most Water)

輸入：height = [1,8,6,2,5,4,8,3,7]
輸出：49
說明：如圖所示，陣列 [1,8,6,2,5,4,8,3,7] 表示豎直線的高度。在這個例子中，容器能容納最多水（藍色區域）的面積為 49。

輸入：height = [1,1]
輸出：1

function maxArea(height: number[]): number {
  // edge case for empty input
 
  // declare max multiply
  // declare two pointer to calculate, left equal to index 0, right to last element
 
  // run a while loop when left < right
    // calculate current max and move pointer
    // move the pointer when smaller than another
 
  // return result
}

function maxArea(height: number[]): number {
  // edge case for empty input
  if (height.length === 0) {
    return 0;
  }
  // declare max multiply
  let max = 0;
 
  // declare two pointer to calculate
  let left = 0;
  let right = height.length - 1;
 
  // run a while loop when left < right
  while (left < right) {
    // calculate current max and move pointer
    const currentWidth = right - left;
    const currentHeight = Math.min(height[left], height[right]);
    max = Math.max(max, currentWidth * currentHeight);
 
    // move the pointer when smaller than another
    if (height[left] < height[right]) {
      left++;
    } else {
      right--;
    }
  }
 
  // return result
  return max;
}

describe('Container With Most Water', () => {
  test.each([
    {
      input: [1, 8, 6, 2, 5, 4, 8, 3, 7],
      expected: 49,
    },
    {
      input: [1, 1],
      expected: 1,
    },
    {
      input: [],
      expected: 0,
    },
  ])('should return $expected when input is $input', ({ input, expected }) => {
    expect(maxArea(input)).toBe(expected);
  });
});