-
Notifications
You must be signed in to change notification settings - Fork 73
Expand file tree
/
Copy pathJumpGame.java
More file actions
38 lines (35 loc) · 884 Bytes
/
JumpGame.java
File metadata and controls
38 lines (35 loc) · 884 Bytes
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
package algorithm.lc;
/**
* 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.
*
* Determine if you are able to reach the last index.
*
* For example: A = [2,3,1,1,4], return true.
*
* A = [3,2,1,0,4], return false.
*
*/
// O(1) space, O(n) time
public class JumpGame {
public class Solution {
// update the upper bound of reachable
public boolean canJump(int[] A) {
// Start typing your Java solution below
// DO NOT write main() function
int pos = 0;
int reachable = 0;
while (pos <= reachable) {
reachable = Math.max(reachable, pos + A[pos]);
if (reachable >= A.length - 1) {
return true;
}
++pos;
}
return false;
}
}
}