LeetCode:Jump Game(Greedy DpUpdate)

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.

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.

解决思路：由于每层最多可以跳 nums[i]步 亦可以1步或0步 我们可以每层每层的往上跳 看一下到达的最高层是否大于等于n

class Solution {
public:
    bool canJump(vector<int>& nums) {
        int n=nums.size();
        
        int maxreach=1;
        for(int i=0;i<maxreach && maxreach<n;i++)
            maxreach=max(maxreach,i+nums[i]+1);
        
        return maxreach>=n;
    }
};

 

这道题也可以用动规解决 need update