leetcode55. 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.

解法一

动态规划，时间复杂度o(n^2)，此解法超时。

public class Solution {
    public boolean canJump(int[] nums) {
        if (nums == null || nums.length == 0) {
            return false;
        }
        boolean[] can = new boolean[nums.length];
        can[0] = true;

        for (int i = 1; i < nums.length; i++) {
            for (int j = 0; j < i; j++) {
                if (can[j] && j + nums[j] >= i) {
                    can[i] = true;
                    break;
                }
            }
        }

        return can[nums.length - 1];
    }
}

解法二

贪心算法

public class Solution {
    public boolean canJump(int[] nums) {
        if (nums == null || nums.length == 0) {
            return false;
        }

        int farthest = nums[0];
        for (int i = 1; i < nums.length; i++) {
            if (i <= farthest && i + nums[i] >= farthest) {
                farthest = i + nums[i];
            }
        }

        return farthest >= nums.length - 1;
    }
}

解法三

改进解法二
如果i > farthest，直接不可达，return false。

public class Solution {
    public boolean canJump(int[] nums) {
        if (nums == null || nums.length == 0) {
            return false;
        }

        int farthest = nums[0];
        for (int i = 1; i < nums.length; i++) {
            // 如果i > farthest,直接不可达。
            if (i > farthest) {
                return false;
            }
            if (i <= farthest && i + nums[i] >= farthest) {
                farthest = i + nums[i];
            } 
        }

        return farthest >= nums.length - 1;
    }
}