leetcode学习笔记55 jump-game

问题

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.

Example 1:

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

Constraints:

• 1 <= nums.length <= 3 * 10^4
• 0 <= nums[i][j] <= 10^5

思考

动态规划.

方法1

从头开始遍历, 并且用一个数组记录下当前点是否可以到达.

时间复杂度O(n).
空间复杂度O(n).

class Solution {
    public boolean canJump(int[] nums) {
        int len = nums.length;
        boolean[] memo = new boolean[len];
        // 从第一个节点开始
        memo[0] = true;
        for(int i = 0; i < len - 1; i++){
            // 如果当前节点不可到达, 跳过
            if(!memo[i])
                continue;
            int step = nums[i];
            for(int j = 1; j <= step && i + j < len; j++){
                if(!memo[i + j])
                    memo[i+j] = true;
            }
        }
        return memo[len - 1];
    }
}