FilesExpand file tree

master

/

_11.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

28 lines (24 loc) · 975 Bytes

master

/

_11.java

Copy path

Top

File metadata and controls

• Code
• Blame

28 lines (24 loc) · 975 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

package com.fishercoder.solutions;

/**

* 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.

*/

public class _11 {

public int maxArea(int[] height) {

int max = Integer.MIN_VALUE;

int len = height.length;

int i = 0, j = len - 1;

while (i < j) {

if (Math.min(height[i], height[j]) * (j - i) > max) {

max = Math.min(height[i], height[j]) * (j - i);

}

if (height[i] <= height[j]) {// we need to find the shorter one,

// then calculate its area

i++;

} else {

j--;

}

}

return max;

}

}