LeetCode 55. Jump Game&&LeetCode 45. Jump Game II

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.

Example 1:

Input: [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.
Example 2:

Input: [3,2,1,0,4]
Output: false
Explanation: You will always arrive at index 3 no matter what. Its maximum
jump length is 0, which makes it impossible to reach the last index.

题目大意 给出一个数组代表每一步可以走的步数 问是否可以走到数组最后
这里我们分析用 贪心的思想来做 从数组的头开始 我们从0开始 我们可以迈出 的步伐是个范围值 所以 我们接下来可以走的便确定了 依次递推 只有前边走了 我们才有可能考虑下一步 如果有一个点到不了 那么后边的点也到不了（不容易考虑的点）

class Solution {
public:
    bool canJump(vector<int>& nums) {
    int ans=0;
    for(int i=1;i<nums.size();i++)
    {
        while(ans<i&&i>ans+nums[ans])
            ans++;
        if(ans==i)
            return false;
    }
    return true;
    }
};

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.

Example:

Input: [2,3,1,1,4]
Output: 2
Explanation: 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) {
    int ans=0;
    vector<int>f(nums.size());
    f[0]=0;
    for(int i=1;i<nums.size();i++)
    {
        while(i>ans+nums[ans])
        {
            ans++;
        }
        f[i]=f[ans]+1;
    } 
    return f[nums.size()-1]; 
    }
};