FilesExpand file tree

 master

/

ContainerWithMostWater.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

28 lines (25 loc) · 974 Bytes

 master

/

ContainerWithMostWater.java

Top

File metadata and controls

• Code
• Blame

28 lines (25 loc) · 974 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

/*

Author: King, wangjingui@outlook.com

Date: Dec 20, 2014

Problem: Container With Most Water

Difficulty: Easy

Source: https://oj.leetcode.com/problems/container-with-most-water/

Notes:

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.

Solution: From both sides to the center.

*/

public class Solution {

public int maxArea(int[] height) {

int left = 0, right = height.length - 1;

int res = 0;

while (left < right) {

res = Math.max(res, Math.min(height[left],height[right]) * (right - left));

if (height[left] > height[right]) --right;

else ++left;

}

return res;

}

}