PHP Program for Minimum number of jumps to reach end

Last Updated : 09 Nov, 2023

Write a PHP program for a given array arr[] where each element represents the maximum number of steps that can be made forward from that index. The task is to find the minimum number of jumps to reach the end of the array starting from index 0.
If an element is 0, then cannot move through that element.

Examples:

Input: arr[] = {1, 3, 5, 8, 9, 2, 6, 7, 6, 8, 9}
Output: 3 (1-> 3 -> 9 -> 9)
Explanation: Jump from 1st element to 2nd element as there is only 1 step. Now there are three options 5, 8 or 9. If 8 or 9 is chosen then the end node 9 can be reached. So 3 jumps are made.

Input: arr[] = {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}
Output: 10
Explanation: In every step a jump is needed so the count of jumps is 10.

Recommended: Please solve it on “PRACTICE ” first, before moving on to the solution.

PHP Program for Minimum number of jumps to reach end using Recursion:

Start from the first element and recursively call for all the elements reachable from the first element. The minimum number of jumps to reach end from first can be calculated using the minimum value from the recursive calls.

minJumps(start, end) = 1 + Min(minJumps(k, end)) for all k reachable from start.

Step-by-step approach:

Create a recursive function.
In each recursive call get all the reachable nodes from that index.
- For each of the index call the recursive function.
- Find the minimum number of jumps to reach the end from current index.
Return the minimum number of jumps from the recursive call.

Below is the implementation of the above approach:

PHP

<?php
// php program to find Minimum 
// number of jumps to reach end

// Returns minimum number of jumps 
// to reach arr[h] from arr[l]
function minJumps($arr, $l, $h)
{
    
    // Base case: when source and
    // destination are same
    if ($h == $l)
        return 0;
    
    // When nothing is reachable
    // from the given source
    if ($arr[$l] == 0)
        return $h+1;
    
    // Traverse through all the points 
    // reachable from arr[l]. Recursively
    // get the minimum number of jumps
    // needed to reach arr[h] from these
    // reachable points.
    $min = 999999;
    
    for ($i = $l+1; $i <= $h && 
            $i <= $l + $arr[$l]; $i++)
    {
        $jumps = minJumps($arr, $i, $h);
        
        if($jumps != 999999 && 
                    $jumps + 1 < $min)
            $min = $jumps + 1;
    }
    
    return $min;
}

// Driver program to test above function
$arr = array(1, 3, 5, 8, 9, 2, 6, 7, 6, 8, 9);
$n = count($arr);

echo "Minimum number of jumps to reach "
    . "end is ". minJumps($arr, 0, $n-1);
    
// This code is contributed by Sam007
?>

PHP Program for Minimum number of jumps to reach end Using Dynamic Programming (Memoization):

It can be observed that there will be overlapping subproblems.
For example in array, arr[] = {1, 3, 5, 8, 9, 2, 6, 7, 6, 8, 9} minJumps(3, 9) will be called two times as arr[3] is reachable from arr[1] and arr[2]. So this problem has both properties (optimal substructure and overlapping subproblems) of Dynamic Programming.

Step-by-step approach:

Create memo[] such that memo[i] indicates the minimum number of jumps needed to reach memo[n-1] from memo[i] to store previously solved subproblems.

During the recursion call, if the same state is called more than once, then we can directly return the answer stored for that state instead of calculating again.

Otherwise, In each recursive call get all the reachable nodes from that index.

For each of the index call the recursive function.
Find the minimum number of jumps to reach the end from current index.

Below is the implementation of the above approach:

PHP

<?php function jump($nums, $idx, $end, &$memo) { if ($idx == $end) { return 0; } if ($memo[$idx] != -1) { return $memo[$idx]; } $minJumps = PHP_INT_MAX - 1; for ($j = $nums[$idx]; $j >= 1; $j--) { if ($idx + $j <= $end) { $minJumps = min($minJumps, 1 + jump($nums, $idx + $j, $end, $memo)); } } return $memo[$idx] = $minJumps; } function minJumps($nums) { $memo = array_fill(0, count($nums), -1); return jump($nums, 0, count($nums) - 1, $memo); } $nums = [1, 3, 5, 8, 9, 2, 6, 7, 6, 8, 9]; echo minJumps($nums) . PHP_EOL; ?>

PHP Program for Minimum number of jumps to reach end using Dynamic Programming (Tabulation):

Step-by-step approach:

Create jumps[] array from left to right such that jumps[i] indicate the minimum number of jumps needed to reach arr[i] from arr[0].

To fill the jumps array run a nested loop inner loop counter is j and the outer loop count is i.

Outer loop from 1 to n-1 and inner loop from 0 to i.
If i is less than j + arr[j] then set jumps[i] to minimum of jumps[i] and jumps[j] + 1. initially set jump[i] to INT MAX

Return jumps[n-1].

Below is the implementation of the above approach:

PHP

<?php // PHP code for Minimum number of // jumps to reach end // Returns minimum number of jumps // to reach arr[n-1] from arr[0] function minJumps($arr, $n) { // jumps[n-1] will // hold the result $jumps = array($n); if ($n == 0 || $arr[0] == 0) return 999999; $jumps[0] = 0; // Find the minimum number of // jumps to reach arr[i] // from arr[0], and assign // this value to jumps[i] for ($i = 1; $i < $n; $i++) { $jumps[$i] = 999999; for ($j = 0; $j < $i; $j++) { if ($i <= $j + $arr[$j] && $jumps[$j] != 999999) { $jumps[$i] = min($jumps[$i], $jumps[$j] + 1); break; } } } return $jumps[$n-1]; } // Driver Code $arr = array(1, 3, 5, 8, 9, 2, 6, 7, 6, 8, 9); $size = count($arr); echo "Minimum number of jumps to reach end is ". minJumps($arr, $size); // This code is contributed by Sam007 ?>

PHP Program for Minimum number of jumps to reach end

Recommended: Please solve it on “PRACTICE ” first, before moving on to the solution.

PHP Program for Minimum number of jumps to reach end using Recursion:

PHP Program for Minimum number of jumps to reach end Using Dynamic Programming (Memoization):

PHP Program for Minimum number of jumps to reach end using Dynamic Programming (Tabulation):

Please Login to comment...

Similar Reads

What kind of Experience do you want to share?