[leetcode] 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.

// 一维的动态规划问题

public class Solution {
    public boolean canJump(int[] A) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int n = A.length;
        if(n<=1)
            return true;
        boolean [] ret = new boolean[n];
        ret[n-1] = true;
        for(int i=n-2; i>=0; i--)
        {
            int max_len = A[i];
            for(int j=i+1; j<n && j<=i+max_len; j++)
            {
                ret[j] = true;
                break;
            }
        }
        return ret[0];
    }
}