class Solution {
    int solve(int[] nums, int i) {
        if (i == nums.length - 1) {
            return 0;
        }
        int result = nums.length;
        for (int j = i + 1; j <= Math.min(nums.length - 1, i + nums[i]); ++j) {
            result = Math.min(result, 1 + solve(nums, j));
        }
        return result;
    }
    public int jump(int[] nums) {
        return solve(nums, 0);
    }
}