|
| 1 | +## **Problem Statement** |
| 2 | + |
| 3 | +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])`. |
| 4 | + |
| 5 | +Find two lines that together with the x-axis form a container, such that the container contains the most water. |
| 6 | + |
| 7 | +Return the maximum amount of water a container can store. |
| 8 | + |
| 9 | +Notice that you may not slant the container. |
| 10 | + |
| 11 | +### Example 1 |
| 12 | + Input: height = [1,8,6,2,5,4,8,3,7] |
| 13 | + Output: 49 |
| 14 | + |
| 15 | + Explanation: The vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. |
| 16 | + In this case, the max area of water the container can contain is 49. Derived from (1, height[1]) and (8, height[8]) which gives us the heights; h1 = 8, h2 = 7. |
| 17 | + To get the width: 8 - 1 = 7 |
| 18 | + To get height = min(8, 7) = 7 |
| 19 | + To get area = height * width = 7 * 7 = 49 |
| 20 | + |
| 21 | +### Example 2 |
| 22 | + Input: height = [1,1] |
| 23 | + Output: 1 |
0 commit comments