Description
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
可以把这个问题看成一个贪心问题。
在每次选择下一跳的时候,选择能够跳到最远的一步(这个值通过num[i]+i
判断)。由此可以通过一个循环来解决。
Source Code
submission
class Solution {
public:
int jump(vector<int>& nums) {
int i(0), j(1), steps(0), N(nums.size());
while(j < N){
int endj = min(nums[i]+i+1, N);
while(j < endj){
if(nums[j] + j > nums[i] + i) i = j;
j++;
}
steps++;
}
return steps;
}
};