LintCode 跳跃游戏题目分析代码

public class Solution {
    /**
     * @param A: A list of integers
     * @return: The boolean answer
     */
    public boolean canJump(int[] A) {
        boolean[] can = new boolean[A.length];
        can[0] = true;
        
        for(int i=1;i<A.length;i++) {
            for(int j=0;j<i;j++) {
                if(j+A[j]>=i && can[j]) {
                    can[i] = true;
                    break;
                }
                    
            }
        }
        
        return can[A.length-1];

    }
}

public class Solution {
    /**
     * @param A: A list of integers
     * @return: The boolean answer
     */
    public boolean canJump(int[] A) {
        if(A.length == 0 || A == null)
            return false;
        
        int farthest = A[0];
        
        for(int i=1;i<A.length;i++) {
            if(i+A[i]>farthest && farthest>=i)
                farthest = i+A[i];
        }
        
        return farthest >= A.length-1;

    }
}