|
| 1 | +<h2><a href="https://leetcode.com/problems/container-with-most-water/">11. Container With Most Water</a></h2><h3>Medium</h3><hr><div><p>You are given an integer array <code>height</code> of length <code>n</code>. There are <code>n</code> vertical lines drawn such that the two endpoints of the <code>i<sup>th</sup></code> line are <code>(i, 0)</code> and <code>(i, height[i])</code>.</p> |
| 2 | + |
| 3 | +<p>Find two lines that together with the x-axis form a container, such that the container contains the most water.</p> |
| 4 | + |
| 5 | +<p>Return <em>the maximum amount of water a container can store</em>.</p> |
| 6 | + |
| 7 | +<p><strong>Notice</strong> that you may not slant the container.</p> |
| 8 | + |
| 9 | +<p> </p> |
| 10 | +<p><strong>Example 1:</strong></p> |
| 11 | +<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/17/question_11.jpg" style="width: 600px; height: 287px;"> |
| 12 | +<pre><strong>Input:</strong> height = [1,8,6,2,5,4,8,3,7] |
| 13 | +<strong>Output:</strong> 49 |
| 14 | +<strong>Explanation:</strong> 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. |
| 15 | +</pre> |
| 16 | + |
| 17 | +<p><strong>Example 2:</strong></p> |
| 18 | + |
| 19 | +<pre><strong>Input:</strong> height = [1,1] |
| 20 | +<strong>Output:</strong> 1 |
| 21 | +</pre> |
| 22 | + |
| 23 | +<p> </p> |
| 24 | +<p><strong>Constraints:</strong></p> |
| 25 | + |
| 26 | +<ul> |
| 27 | + <li><code>n == height.length</code></li> |
| 28 | + <li><code>2 <= n <= 10<sup>5</sup></code></li> |
| 29 | + <li><code>0 <= height[i] <= 10<sup>4</sup></code></li> |
| 30 | +</ul> |
| 31 | +</div> |
0 commit comments