leetcode 45.跳跃游戏Ⅱ

int d[100007];

class Solution {
public:
    int jump(vector<int>& nums) {
        memset(d,127,sizeof(d));
        d[0]=0;
        for (int i=0;i<nums.size();i++)
            for (int j=1;i+j<nums.size()&&j<=nums[i];j++)
                d[i+j]=d[i+j]<d[i]+1?d[i+j]:d[i]+1;
        return d[nums.size()-1];
    }
};