problem:
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.)
而这道题,需要求的是最少的步数。因此需要添加step变量记录最少步数。
引入last变量记录上一步能到达的最远位置。reach、step、last的初始值均为0。当遍历到i的时候,如果i超过了last(即上一步能到达的最远位置),说明步数需要加1(即step++),此时仍需要更新last为当前最远位置reach。即对数组进行遍历,每当i超过了上一步能跳的最远位置,就肯定要再跳一步,至于再跳的肯定是可跳范围内最远的那一个。
class Solution {
public:
int jump(vector<int>& nums) {
int reach = 0; //当前位置所能到达的最远距离
int step = 0; //已跳步数
int last = 0; //记录上一步能跳跃到的最远位置
int pos = 0;
while(pos < nums.size())
{
//if(pos <= reach)
//{
if(pos > last)
{
++step;
last = reach;
}
reach = max(reach, nums[pos]+pos);
//}
pos ++;
}
return reach >= nums.size()-1 ? step:0;
}
};