The Hurdle Race - HackerRank.
Dan is playing a video game in which his character competes in a hurdle race. Hurdles are of varying heights, and Dan has a maximum height he can jump. There is a magic potion he can take that will increase his maximum height by unit for each dose. How many doses of the potion must he take to be able to jump all of the hurdles.
Given an array of hurdle heights , and an initial maximum height Dan can jump, , determine the minimum number of doses Dan must take to be able to clear all the hurdles in the race.
For example, if and Dan can jump unit high naturally, he must take doses of potion to be able to jump all of the hurdles.
Function Description
Complete the hurdleRace function in the editor below. It should return the minimum units of potion Dan needs to drink to jump all of the hurdles.
hurdleRace has the following parameter(s):
- k: an integer denoting the height Dan can jump naturally
- height: an array of integers denoting the heights of each hurdle
Input Format
The first line contains two space-separated integers and , the number of hurdles and the maximum height Dan can jump naturally.
The second line contains space-separated integers where .
The second line contains space-separated integers where .
Constraints
Output Format
Print an integer denoting the minimum doses of magic potion Dan must drink to complete the hurdle race.
Sample Input 0
5 4
1 6 3 5 2
Sample Output 0
2
Explanation 0
Dan's character can jump a maximum of units, but the tallest hurdle has a height of :
To be able to jump all the hurdles, Dan must drink doses.
Sample Input 1
5 7
2 5 4 5 2
Sample Output 1
0
Explanation 1
Dan's character can jump a maximum of units, which is enough to cross all the hurdles:
Because he can already jump all the hurdles, Dan needs to drink doses.
NOTE: If you are copying my code then its a advise to you to copy it after downloading it to avoid any kind of compilation error its link is available at the bottom of source code.
SOURCE CODE
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class Solution {
// Complete the hurdleRace function below.
static int hurdleRace(int k, int[] height) {
int max=0;
for(int i=0;i<height.length;i++)
{
if(max<height[i])
{
max=height[i];
}
}
if(max>k)
return(max-k);
else
return(0);
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
String[] nk = scanner.nextLine().split(" ");
int n = Integer.parseInt(nk[0]);
int k = Integer.parseInt(nk[1]);
int[] height = new int[n];
String[] heightItems = scanner.nextLine().split(" ");
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int i = 0; i < n; i++) {
int heightItem = Integer.parseInt(heightItems[i]);
height[i] = heightItem;
}
int result = hurdleRace(k, height);
bufferedWriter.write(String.valueOf(result));
bufferedWriter.newLine();
bufferedWriter.close();
scanner.close();
}
}
OUTPUT
If you have any question then leave a comment below I will do my best to answer that question.
Comments
Post a Comment