LeetCode 011 Container With Most Water

LeetCode

You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the i<sup>th</sup> 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 <= 10<sup>5</sup>
* 0 <= height[i] <= 10<sup>4</sup>

题目大意：

求两板之间的最大水量

解题思路：

贪婪法，求面积，然后移动矮的那条边

解题步骤：

N/A

注意事项：

1. 贪婪法，求面积，然后移动矮的那条边

Python代码：

def maxArea(self, height: List[int]) -> int:
	res = 0
	i, j = 0, len(height) - 1
	while i < j:
		res = max(res, min(height[i], height[j]) * (j - i))
		if height[i] < height[j]:
			i += 1
		else:
			j -= 1
	return res

算法分析：

时间复杂度为O(n)，空间复杂度O(1)