```
public class Solution {
public boolean canJump(int[] nums) {
if(nums == null || nums.length == 0) return false;
int n = nums.length;
int minJumpIndex = n-1;
for(int i = n-2;i>=0;i--){
if(i+nums[i]>=minJumpIndex){
minJumpIndex = i;
}
}
return minJumpIndex == 0;
}
}
```