Jump Game II.cpp

/*
You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0].

Each element nums[i] represents the maximum length of a forward jump from index i. In other words, if you are at nums[i], you can jump to any nums[i + j] where:

0 <= j <= nums[i] and
i + j < n
Return the minimum number of jumps to reach nums[n - 1]. The test cases are generated such that you can reach nums[n - 1].

 */

class Solution {
public:
    int jump(vector<int>& nums) {
        int n=nums.size();
        vector<int> dp(n,INT_MAX);
        dp[0]=0;
        
        for(int i=0;i<n;i++)
        {
            int step = nums[i];
            for(int j=1;j<=step and i+j<n;j++)
            {
                dp[i+j]=min(dp[i+j], dp[i]+1);
            }
        }
        
        return dp[n-1];
    }
};