public static boolean canJump(int[] nums) {
int n=nums.length;
boolean[] dp=new boolean[n];//能否到达i
dp[0]=true;
for (int i = 1; i < n; i++) {
//查找能到达i的j
for (int j = 0; j < i; j++) {
if(dp[j]==true&&j+nums[j]>=i)
{
dp[i]=true;
break;
}
}
}
return dp[n-1];
}