【朱迪的LeetCode刷题笔记】】11. Container With Most Water #Medium #Python

Judie

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:
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 <= 105
0 <= height[i] <= 104

Hint
(1/3)
If you simulate the problem, it will be O(n^2) which is not efficient.

Hint
(2/3)
Try to use two-pointers. Set one pointer to the left and one to the right of the array. Always move the pointer that points to the lower line.

Hint
(3/3)
How can you calculate the amount of water at each step?

Judy
Python inspired by hints

1. class Solution(object):
   
2.     def maxArea(self, height):
   
3.         """
   
4.         :type height: List[int]
   
5.         :rtype: int
   
6.         """
   
7.         l = len(height)
   
8.         i = 0
   
9.         j = l-1
   
10.         c = 0
    
11.         while i != j:
    
12.             if height[i] < height[j]:
    
13.                 if (j-i) * height[i] > c:
    
14.                     c = (j-i) * height[i]
    
15.                 i += 1
    
16.             else:
    
17.                 if (j-i) * height[j] > c:
    
18.                     c = (j-i) * height[j]
    
19.                 j -= 1
    
20.         return c

复制代码

yinda_peng

强