LeetCode 55. Jump Game 跳跃游戏

Question:

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.

思路：

使用贪心算法，寻找下一次可以跳到最远的点，即jump=(index~next_nums[index])时寻找next_nums[jump]最大值，找到后jump就继续向前遍历，直到下一个next_nums[jump]最大值，若jump比nums.length大，那就是能走到末尾，否则不能。

因为告诉了最大可以达到index，首先算出对于每一个nums[i]，下一次可到达的next_nums[i] = i+nums[i]。然后使用一个变量jump, 遍历index= 从i 到 next_nums[i]的next_nums[jump]，利用max_index存储遍历得到的最大的next_nums[jump]，即作为当前跳跃点。

class Solution {
    public boolean canJump(int[] nums) {
        int len = nums.length;
        int[] next_nums = new int[len];
        for(int i=0; i<len; i++)
        {
            next_nums[i]=i+nums[i];
        }
        int jump = 0;
        int max_index = next_nums[0];
        while(jump<len && jump <= max_index )
        {
            if(max_index < next_nums[jump])
            {
                max_index = next_nums[jump];
            }
            jump++;
        }
        if(jump >= len)
            return true;
        else 
            return false;
    }
}