mirror of
https://github.com/prdlk/leetcode.git
synced 2026-09-16 23:16:26 +00:00
49 lines
1.2 KiB
Plaintext
49 lines
1.2 KiB
Plaintext
---
|
|
title: '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 i^th line are (i, 0) and (i, height[i])
|
|
sidebar:
|
|
label: 'Container With Most Water'
|
|
badge: 'Medium'
|
|
---
|
|
|
|
<Badge variant="accent">Two Pointers</Badge>
|
|
|
|
::::warning
|
|
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`
|
|
|
|
### Constraints:
|
|
|
|
- `n == height.length`
|
|
- `2 <= n <= 10^5`
|
|
- `0 <= height[i] <= 10^4`
|
|
|
|
## Solution
|
|
|
|
```py
|
|
class Solution:
|
|
def maxArea(self, height: List[int]) -> int: # noqa: F821
|
|
res = 0
|
|
left = 0
|
|
right = len(height) - 1
|
|
|
|
while left < right:
|
|
area = (right - left) * min(height[left], height[right])
|
|
res = max(res, area)
|
|
if height[left] < height[right]:
|
|
left += 1
|
|
else:
|
|
right -= 1
|
|
|
|
return res
|
|
```
|