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.

最开始想的是一维DP，从后往前，存从这个点能否到终点。

public class Solution {
    public boolean canJump(int[] A) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if(A == null || A.length == 0) return false;
        int len = A.length;
        boolean[] map = new boolean[len];
        map[len - 1] = true;
        for(int i = len - 1; i > -1; i --)
        {
            for(int j = 1; j <= A[i]; j ++)
            {
                if(i + j < len && map[i + j] == true)
                {
                    map[i] = true;
                    break;
                }
            }
        }
        return map[0];
    }
}

但是过不了大测试。

一维DP，定义 jump[i]为从index 0 走到第i步时，剩余的最大步数。

那么转移方程可定义为

 jump[i] = max(jump[i-1], A[i-1]) -1, i!=0  
         = 0 , i==0  

然后从左往右扫描，当jump[i]<0的时候，意味着不可能走到i步，所以return false; 如果走到最右端，那么return true.

public class Solution {
       // DO NOT write int main() function  
    public boolean canJump(int[] A) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if(A == null || A.length == 0) return false;
        int len = A.length;
        int[] map = new int[len];
        for(int i = 1; i < len; i ++)
        {
            map[i] = Math.max(map[i - 1], A[i - 1]) - 1;
            if(map[i] < 0)
                return false;
        }
        return return map[n-1] >=0;  
    }
}

 第二遍： 不需要使用数组，只要constant space 即可。

public class Solution {
       // DO NOT write int main() function  
    public boolean canJump(int[] A) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if(A == null || A.length == 0) return false;
        int MaxLengthRemain = 0;
        for(int i = 1; i < A.length; i ++){
            MaxLengthRemain = Math.max(MaxLengthRemain, A[i - 1]) - 1;
            if(MaxLengthRemain < 0) return false;
        }
        return true;
    }
}

 第三遍：

public class Solution {
    public boolean canJump(int[] A) {
        if(A == null || A.length == 0) return false;
        int step = 0;
        for(int i = 1; i < A.length; i ++){
            step = Math.max(step, A[i - 1]) - 1;
            if(step < 0) return false;
        }
        return true;
    }
}