一、题目
二、代码
class Solution
{
//动态规划
public int jump(int[] nums)
{
int i,j;
int length = nums.length;
int[] dp = new int [length];
for(i=0;i<length;i++) dp[i] = Integer.MAX_VALUE;
dp[0] = 0;
for(i=0;i<length;i++)
{
for(j=1;j<=nums[i];j++)
{
if(i+j>=length) break;
dp[i+j] = Math.min(dp[i+j],dp[i]+1);
}
}
return dp[length-1];
}
}