Leetcode55 Jump Game

Posted 2022-12-07 xuweimdm

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.

Solution

• 在Leetcode45 Jump Game II中，可以将那里的思路非常好的应用到这里。

public class Solution 
    public boolean canJump(int[] nums) 
        int farthest = 0;
        for(int i=0;i<nums.length;i++)
            farthest = Math.max(farthest,i+nums[i]);
            if(farthest>=nums.length-1) return true;
            if(farthest<=i) return false;
        
        return true;