Question
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.
Solution
Jump game II 因为要求出来路径长度,就不可以用动态规划了。首先想到的是BFS,然后根据这个BFS的思路想着一层一层的找,从某一层,找到该层可以去到的所有位置。容易想到,可以去到的所有位置应该是一个区间,区间的左端为上一层区间的右端+1,右端为上一层能去到最远的位置。
根据这个思路,一层一层的搜索,一开始第一层只有位置0的值,从这一层出发,遍历这一层的区间([0, 0])所有的数,找到能去到最远的地方(maxj)。然后得到下一层的区间(当前层的right+1到maxj),然后开始找下一层。
代码如下:
时间复杂度为O(n),注意left和right都只能往前移动。
class Solution {
public:
int jump(vector<int>& nums) {
if (nums.size() < 2)
return 0;
int left = 0, right = 0;
int tmp, res = 0, maxj;
while (left <= right) {
res++;
maxj = -1;
while (left <= right) {
maxj = max(maxj, nums[left] + left);
left++;
if (maxj >= nums.size()-1)
return res;
}
right = maxj;
}
return -1;
}
};