Jump Game II Leetcode Solution in java | 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].

public int jump(int[] A) {

int jumps = 0, curEnd = 0, curFarthest = 0;

for (int i = 0; i < A.length - 1; i++) {

curFarthest = Math.max(curFarthest, i + A[i]);

if (i == curEnd) {

jumps++;

curEnd = curFarthest;

}

}

return jumps;

}