-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathJump_Game.java
More file actions
35 lines (25 loc) · 986 Bytes
/
Jump_Game.java
File metadata and controls
35 lines (25 loc) · 986 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
// You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position.
// Return true if you can reach the last index, or false otherwise.
// Example 1:
// Input: nums = [2,3,1,1,4]
// Output: true
// Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.
// Example 2:
// Input: nums = [3,2,1,0,4]
// Output: false
// Explanation: You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index.
public class Jump_Game {
public boolean jump(int nums[]){
int max_jump = 0;
for (int i = 0; i < nums.length; i++) {
if(i > max_jump){
return false;
}
max_jump = Math.max(max_jump, i+nums[i]);
if(max_jump >= nums.length - 1){
return true;
}
}
return true;
}
}