FilesExpand file tree

 master

/

JumpGameII.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

36 lines (35 loc) · 1.02 KB

 master

/

JumpGameII.java

Copy path

Top

File metadata and controls

• Code
• Blame

36 lines (35 loc) · 1.02 KB

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

31

32

33

34

35

36

package com.yangchd.leetcode.hard;

/**

* @author yangchd 2018/9/12.

*

* 45. Jump Game II

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

*

* Example:

* Input: [2,3,1,1,4]

* Output: 2

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

*

* Note:

* You can assume that you can always reach the last index.

*/

public class JumpGameII {

class Solution {

public int jump(int[] nums) {

int sc = 0;

int e = 0;

int max = 0;

for (int i = 0; i < nums.length - 1; i++) {

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

if (i == e) {

sc++;

e = max;

}

}

return sc;

}

}

}