leetcode

0 class Solution {

1 public:

2 int jump(vector<int> &nums) {

3 int n = nums.size(), limit = 0;

4 vector<int> num(n);

5 num[0] = 0;

6 for (int i = 0; i <= limit && i < n; i++) {

7 for (int j = limit + 1; j <= i + nums[i] && j < n; j++)

8 num[j] = num[i] + 1;

9 limit = max(limit, i + nums[i]);

10 }

11 return num.back();

12 }

13 };