[LeetCode] 45. Jump Game2

Jump Game2

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.

解析

类似于之前的Jump Game，这里要求最小的跳的次数。
扫描数组，确定当前最远能覆盖的节点，放入cur。然后继续扫描，直到当前的路程超过了上一次算出的覆盖范围，那么更新覆盖范围，同时更新跳数，因为我们是经过了多一跳才能继续前进的。

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

参考

http://www.cnblogs.com/grandyang/p/4373533.html