Jump Game II leetcode Solution in c++ | Hindi Coding Community

 

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(), step = 0, start = 0, end = 0;

while (end < n - 1) {

step++;

int maxend = end + 1;

for (int i = start; i <= end; i++) {

if (i + nums[i] >= n - 1) return step;

maxend = max(maxend, i + nums[i]);

}

start = end + 1;

end = maxend;

}

return step;

}

};