Module leetcode_rust::problems::p000_0xx::p000_011

source ·
Expand description

Problem #11 Container With Most Water

Description

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:

Image

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

Constraints:

  • n == height.length
  • 2 $\leqslant$ n $\leqslant$ $10^5$
  • 0 $\leqslant$ height[i] $\leqslant$ $10^4$

Find out this blog about this problem (though it’s in Chinese).

Sources: https://leetcode.com/problems/container-with-most-water/description/

Functions

max_area
Container With Most Water