LeetCode 11. Container With Most Water - 亚马逊高频题16

CP Coding

于 2022-03-26 22:15:02 发布

阅读量681

点赞数 1

分类专栏：亚马逊高频题 Leetcode刷题笔记文章标签： leetcode 算法 python two pointers 数据结构

本文链接：https://blog.youkuaiyun.com/hgq522/article/details/123764092

版权

给定一个长度为n的整型数组，表示n个柱子，数组中的数表示柱子高度。目标是找到两根柱子形成的最大水槽容量。暴力解法是双层循环，但更优解法是使用双指针从两端开始，每次移动较矮的柱子，以O(n)时间复杂度找到最大容量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.