Leetcode 55. Jump Game (Medium) (java)
Tag: Array, Greedy
Difficulty: Medium
/*
55. Jump Game (Medium)
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.
*/
public class Solution {
public boolean canJump(int[] nums) {
int steps = 0, _size = nums.length;
for (int i = 0; i < _size; i++) {
steps = Math.max(steps, nums[i]);
if (steps >= _size - 1 - i) {
return true;
} else if (--steps < 0) {
return false;
}
}
return false;
}
}