标签：
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.
解法1，递归超时。
代码：
class Solution{ private: bool res;int n; public: void dfs(int A[],int dep){ if(A[dep]==0) { return; } for(int i=1;i<=A[dep]&&!res;++i){ if(i==n-dep-1){ res=true; return; }else{ dfs(A,dep+i); } } return; } bool canJump(int A[], int n) { if(A==NULL||n==0) return false; this->res=false; this->n=n; dfs(A,0); return res; } };
标签：
原文地址：http://www.cnblogs.com/fightformylife/p/4236002.html
