FilesExpand file tree

 master

/

JumpGameII.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

30 lines (29 loc) · 718 Bytes

 master

/

JumpGameII.java

Copy path

Top

File metadata and controls

• Code
• Blame

30 lines (29 loc) · 718 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

29

30

/**

*

* Given an array of non-negative integers, you are initially positioned at the first index of the array.

*

* Each element in the array represents your maximum jump length at that position.

*

* Your goal is to reach the last index in the minimum number of jumps.

*

* For example:

*

* Given array A = [2,3,1,1,4]

*

* The minimum number of jumps to reach the last index is 2. (Jump 1 step from index 0 to 1, then 3 steps to the last index.)

*/

public class JumpGameII {

public int jump(int[] A) {

int ret = 0;

int last = 0;

int curr = 0;

for (int i = 0; i < A.length; ++i) {

if (i > last) {

last = curr;

++ret;

}

curr = Math.max(curr, i + A[i]);

}

return ret;

}

}