container-with-most-water

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an integer array <code>height</code> of length <code>n</code>. There are <code>n</code> vertical lines drawn such that the two endpoints of the <code>ith</code> line are <code>(i, 0)</code> and <code>(i, height[i])</code>.

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.

&nbsp;
Example 1:
<img alt="" src="https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/17/question_11.jpg" style="width: 600px; height: 287px;" />
<pre>
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.
</pre>

Example 2:

<pre>
Input: height = [1,1]
Output: 1
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>n == height.length</code></li>
	<li><code>2 &lt;= n &lt;= 105</code></li>
	<li><code>0 &lt;= height[i] &lt;= 104</code></li>
</ul>

maxArea

Container With Most Water

Trapping Rain Water

trapping-rain-water

接雨水

Maximum Tastiness of Candy Basket

maximum-tastiness-of-candy-basket

礼盒的最大甜蜜度

House Robber IV

house-robber-iv

打家劫舍 IV

Greedy

Array

Two Pointers

给定一个长度为 <code>n</code> 的整数数组&nbsp;<code>height</code>&nbsp;。有&nbsp;<code>n</code>&nbsp;条垂线，第 <code>i</code> 条线的两个端点是&nbsp;<code>(i, 0)</code>&nbsp;和&nbsp;<code>(i, height[i])</code>&nbsp;。

找出其中的两条线，使得它们与&nbsp;<code>x</code>&nbsp;轴共同构成的容器可以容纳最多的水。

返回容器可以储存的最大水量。

说明：你不能倾斜容器。

&nbsp;

示例 1：

<img alt="" src="https://aliyun-lc-upload.oss-cn-hangzhou.aliyuncs.com/aliyun-lc-upload/uploads/2018/07/25/question_11.jpg" />

<pre>
输入：[1,8,6,2,5,4,8,3,7]
输出：49 
解释：图中垂直线代表输入数组 [1,8,6,2,5,4,8,3,7]。在此情况下，容器能够容纳水（表示为蓝色部分）的最大值为&nbsp;49。</pre>

示例 2：

<pre>
输入：height = [1,1]
输出：1
</pre>

&nbsp;

提示：

<ul>
	<li><code>n == height.length</code></li>
	<li><code>2 &lt;= n &lt;= 105</code></li>
	<li><code>0 &lt;= height[i] &lt;= 104</code></li>
</ul>