标签：
https://leetcode.com/problems/jump-game/
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.
Determine if you are able to reach the last index.
For example:
A = [2,3,1,1,4], return true.
A = [3,2,1,0,4], return false.
class Solution {
public:
bool canJump(vector<int>& nums) {
int curPos=0;
for(int i=0;i<nums.size()&&curPos>=i;i++)
{
if(i+nums[i]>curPos)
curPos=i+nums[i];
if(curPos>=nums.size()-1)
return true;
}
return false;
}
};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.)
class Solution {
public:
int jump(vector<int>& nums) {
if (nums.size() == 1)
return 0;
int stepCanGo = -1, step = 0, nextStepPos = nums[0];
for (int i = 0; i<nums.size() && nextStepPos+1<nums.size(); i++)
{
if (i>stepCanGo)
{
step++;
stepCanGo = nextStepPos;
}
if (nextStepPos<i + nums[i])
nextStepPos = i + nums[i];
}
return step+1;
}
};
标签：
原文地址：http://blog.csdn.net/zhouyelihua/article/details/46342465
