-
Notifications
You must be signed in to change notification settings - Fork 21
/
JumpGame.java
39 lines (33 loc) 路 888 Bytes
/
JumpGame.java
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
37
38
39
/**
* Given an array of non-negative integers, you are initially positioned at the first index of the array.
* <p>
* Each element in the array represents your maximum jump length at that position.
* <p>
* Determine if you are able to reach the last index.
* <p>
* For example:
* A = [2,3,1,1,4], return true.
* <p>
* A = [3,2,1,0,4], return false.
* <p>
* Accepted.
*/
public class JumpGame {
public boolean canJump(int[] nums) {
if (nums == null || nums.length == 0) {
return false;
}
if (nums.length == 1) {
return true;
}
int maxLength = 0;
for (int i = 0; i < nums.length - 1; i++) {
maxLength--;
maxLength = Math.max(maxLength, nums[i]);
if (maxLength == 0) {
return false;
}
}
return maxLength > 0;
}
}