Skip to content

Latest commit

 

History

History
21 lines (12 loc) · 550 Bytes

README.md

File metadata and controls

21 lines (12 loc) · 550 Bytes

113.Container With Most Water

Description

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

Note

  • You may not slant the container and n is at least 2.

Example

Input: [1, 1]

Output: 1

From

LeetCode