Minimum length of jumps to avoid given array of obstacles

We are given coordinates of obstacles on a straight line. We start jumping from point 0, we need to reach end avoiding all obstacles. Length of every jump has to be same (For example, if we jump from 0 to 4, then we must make next jump from 4 to 8). We need to find the minimum length of jump so that we can reach end and we avoid all obstacles.

Examples:

Input : obs[] = [5, 3, 6, 7, 9]
Output : 4
Obstacles are at points 3, 5, 6, 7 and 9
We jump from 0 to 4, then 4 to 8, then 4
to 12. This is how we reach end with jumps
of length 4. If we try lower jump lengths,
we cannot avoid all obstacles.

Input : obs[] = [5, 8, 9, 13, 14]
Output : 6

*

We insert locations of all obstacles in a hash table. We also find maximum value of obstacle. Then we try all possible jump sizes from 1 to maximum. If any jump size leads to a obstacle, we do not consider that jump.

Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java program to find length of a jump
// to reach end avoiding all obstacles
import java.util.*;
  
public class obstacle {
    static int avoidObstacles(int[] obs)
    {
        // Insert all array elements in a hash table
        // and find the maximum value in the array
        HashSet<Integer> hs = new HashSet<Integer>();
        int max = obs[0];
        for (int i=0; i<obs.length; i++)
        {
            hs.add(obs[i]);
            max = Math.max(max, obs[i]);
        }
  
        // checking for every possible length which
        // yield us solution
        for (int i = 1; i <= max; i++) {
            int j;
            for (j = i; j <= max; j = j + i) {
  
                // if there is obstacle, break the loop.
                if (hs.contains(j)) 
                    break;
            }
  
            // If above loop did not break
            if (j > max) 
                return i;         
        }
  
        return max+1;
    }
  
    // Driver Code
    public static void main(String[] args)
    {
        int a[] = new int[] { 5, 3, 6, 7, 9 };
        int b = avoidObstacles(a);
        System.out.println(b);
    }
}

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# program to find length of a jump
// to reach end avoiding all obstacles
using System;
using System.Collections.Generic;
  
public class obstacle 
{
    static int avoidObstacles(int[] obs)
    {
        // Insert all array elements in a hash table
        // and find the maximum value in the array
        HashSet<int> hs = new HashSet<int>();
        int max = obs[0];
        for (int i = 0; i < obs.Length; i++)
        {
            hs.Add(obs[i]);
            max = Math.Max(max, obs[i]);
        }
  
        // checking for every possible length which
        // yield us solution
        for (int i = 1; i <= max; i++) 
        {
            int j;
            for (j = i; j <= max; j = j + i)
            {
  
                // if there is obstacle, break the loop.
                if (hs.Contains(j)) 
                    break;
            }
  
            // If above loop did not break
            if (j > max) 
                return i;        
        }
        return max+1;
    }
  
    // Driver Code
    public static void Main()
    {
        int []a = new int[] { 5, 3, 6, 7, 9 };
        int b = avoidObstacles(a);
        Console.WriteLine(b);
    }
}
  
// This code is contributed by 29AjayKumar

chevron_right


Output:

4


My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.



Improved By : 29AjayKumar



Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.