返回题库

盛最多水的容器

Container With Most Water

专题
Algorithmic Programming / 算法编程
难度
L3
来源
Citadel

题目详情

问题：盛最多水的容器

考察：数组、双指针

来源：Citadel

链接：https://www.jointaro.com/interviews/questions/container-with-most-water/

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
解析

思路：用左右双指针夹住容器，面积由较短边决定。每次计算面积后移动较短的一侧，因为移动较高边不可能在宽度变小的同时提升短板。

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