Jump Game

标签：c   style   class   blog   code   java   

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.

class Solution {
public:
    bool canJump(int A[], int n) 
    {
        if(n==0) return false;
        
        bool able[n];
        for(int i=0;i<n;i++) able[i]=false;
        able[0]=true;
        
        int near=0;
        for(int i=0;i<n;i++)
        if(able[i]==true)
            for(int j=near+1-i;j<=A[i] && i+j<n;j++)
            {
                able[i+j]=true;
                near=i+j;
            }
        return able[n-1];
    }
}; 

Jump Game,布布扣,bubuko.com

Jump Game

标签：c   style   class   blog   code   java   

原文地址：http://www.cnblogs.com/erictanghu/p/3759403.html