class Solution {
public:
    int solve(int i, const vector<int>& nums) {
        if (i == nums.size() - 1) {
            return 0;
        }
        int r = nums.size();
        for (int j = i + 1; j < nums.size() && j <= i + nums[i]; ++j) {
            r = min(r, 1 + solve(j, nums));
        }
        return r;
    }
    int jump(vector<int>& nums) {
       return solve(0, nums);
    }
};