55. Jump Game

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.

Related Issue Jump Game II

after entering the loop, you need first check if you can initiate the jump, then update the max distance to jump.

public class Solution {
    public boolean canJump(int[] nums) {
        int max = 0;
        for(int i=0; i<nums.length; i++){
            // [0,1] to consider 
            if(max >= nums.length-1 || i > max)  break;
            max = Math.max(i+nums[i], max);
        return max >= nums.length-1 ? true : false;

results matching ""

    No results matching ""