Skip to content

Latest commit

 

History

History
25 lines (13 loc) · 515 Bytes

File metadata and controls

25 lines (13 loc) · 515 Bytes

Problem 11: Container With Most Water

Difficulty: Medium

Problem

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.

Example

Input: [1, 2]

Output: 1

    |
 _|_|_

Note

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