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.
Your goal is to reach the last index in the minimum number of jumps.
For example:
Given array A = [2,3,1,1,4]
The minimum number of jumps to reach the last index is 2
. (Jump 1
step from index 0 to 1, then 3
steps to the last index.)
Note:
You can assume that you can always reach the last index.
解法1:
创建一个n*n的Boolean表格table,table[i][j]表示第i步能否到达nums[j]。那每次遍历table的第i-1行,找出等于TRUE的列j,表示第i-1步的时候能到达nums[j],然后根据nums[j]去填充第i行,表示第i步的时候能到达哪一列。每次填充完一列去检查一下table[i][n-1]是不是TRUE,若是TRUE则表示能到达nums[j]了,返回i即可
public int jump(int[] nums) {
int n = nums.length;
if(n<=1)
return 0;
boolean[][] b = new boolean[n][n];
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
b[i][j]=false;
int i=0;
for(i=0;i<n;i++)
{
if(i==0)
b[i][0]=true;
else
{
for(int k = 0;k<n;k++)
{
if(b[i-1][k]==true)
{
for(int j=0;j<=nums[k];j++)
if(k+j<n)
b[i][k+j]=true;
}
else break;
}
}
if(b[i][n-1])
break;
}
return i;
}
但是上面的代码超时了,所以需要优化。
解法2:
其实我们每跳一次都会有一个最远的范围range,在range里进行下一跳的时候会有一个最远距离farest。当farest>=n-1de时候,表示下一跳之后就能到达结尾了。我们遍历range,在每个位置都进行下一跳,更新farest,当超出range之后,我们要再跳一步,更新range为当前的farest,然后继续上述操作。
public int jump(int[] nums) {
int n = nums.length;
if(n<=1)
return 0;
int farest = 0;
int i=0;
int count = 1;
int range = 0;
while(farest<n-1)
{
if(i<=range)
{
farest = Math.max(farest, i + nums[i]);
i++;
}
else
{
count++;
range = farest;
}
}
return count;
}