-
Notifications
You must be signed in to change notification settings - Fork 7
/
FrogJmp.sc
46 lines (34 loc) · 1.32 KB
/
FrogJmp.sc
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
object FrogJmp {
// 100%
def solution(X: Int, Y: Int, D: Int): Int = {
val distance: Long = Y - X
val minimum = distance / D
if (distance % D > 0) (minimum + 1).toInt
else minimum.toInt
}
solution(10, 85, 30)
solution(10, 10, 20)
solution(10, 50, 10)
solution(0, 50, 10)
/*
A small frog wants to get to the other side of the road. The frog is currently located at position X and wants to get to a position greater than or equal to Y. The small frog always jumps a fixed distance, D.
Count the minimal number of jumps that the small frog must perform to reach its target.
Write a function:
object Solution { def solution(X: Int, Y: Int, D: Int): Int }
that, given three integers X, Y and D, returns the minimal number of jumps from position X to a position equal to or greater than Y.
For example, given:
X = 10
Y = 85
D = 30
the function should return 3, because the frog will be positioned as follows:
after the first jump, at position 10 + 30 = 40
after the second jump, at position 10 + 30 + 30 = 70
after the third jump, at position 10 + 30 + 30 + 30 = 100
Assume that:
X, Y and D are integers within the range [1..1,000,000,000];
X ≤ Y.
Complexity:
expected worst-case time complexity is O(1);
expected worst-case space complexity is O(1).
*/
}