LeetCode 55 Jump Game (dp)

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/Tc_To_Top/article/details/88607148

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.

Example 1:

Input: [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: [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.

题目链接：https://leetcode.com/problems/jump-game/

题目分析：不断更新当前所能到达的最远距离，若当此距离小于当前下标，则说明到不了当前位置

3ms，时间击败100%

class Solution {
    public boolean canJump(int[] nums) {
        for (int i = 0, cur = 0; i < nums.length; i++) {
            if (cur < i) {
                return false;
            }
            cur = Math.max(cur, i + nums[i]);
        }
        return true;
    }
}