Lesson13
Fibonacci numbers
Medium
FibFrog
Count the minimum number of jumps required for a frog to get to the other side of a river.
Task description
The Fibonacci sequence is defined using the following recursive formula:
F(0) = 0
F(1) = 1
F(M) = F(M - 1) + F(M - 2) if M >= 2
A small frog wants to get to the other side of a river. The frog is initially located at one bank of the river (position −1) and wants to get to the other bank (position N). The frog can jump over any distance F(K), where F(K) is the K-th Fibonacci number. Luckily, there are many leaves on the river, and the frog can jump between the leaves, but only in the direction of the bank at position N.
The leaves on the river are represented in an array A consisting of N integers. Consecutive elements of array A represent consecutive positions from 0 to N − 1 on the river. Array A contains only 0s and/or 1s:
- 0 represents a position without a leaf;
- 1 represents a position containing a leaf.
The goal is to count the minimum number of jumps in which the frog can get to the other side of the river (from position −1 to position N). The frog can jump between positions −1 and N (the banks of the river) and every position containing a leaf.
For example, consider array A such that:
A[0] = 0
A[1] = 0
A[2] = 0
A[3] = 1
A[4] = 1
A[5] = 0
A[6] = 1
A[7] = 0
A[8] = 0
A[9] = 0
A[10] = 0
The frog can make three jumps of length F(5) = 5, F(3) = 2 and F(5) = 5.
Write a function:
class Solution { public int solution(int[] A); }
that, given an array A consisting of N integers, returns the minimum number of jumps by which the frog can get to the other side of the river. If the frog cannot reach the other side of the river, the function should return −1.
For example, given:
A[0] = 0
A[1] = 0
A[2] = 0
A[3] = 1
A[4] = 1
A[5] = 0
A[6] = 1
A[7] = 0
A[8] = 0
A[9] = 0
A[10] = 0
the function should return 3, as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [0..100,000];
- each element of array A is an integer that can have one of the following values: 0, 1.
Code Walkthrough
Optimized greedy algorithm
class Solution {
public int solution(int[] A) {
final int N = A.length;
final int GOAL = N + 1;
final int START = -1;
// fibonacci numbers array
int[] fibs = new int[N+2];
fibs[0] = 1; // 0 1 1
fibs[1] = 2;
for (int i = 2; i < fibs.length; i++) {
fibs[i] = fibs[i-2] + fibs[i-1];
if (fibs[i] == GOAL) return 1;
}
// greedy array
int[] greedy = new int[GOAL];
for (int i = START; i < GOAL; i++) {
// if current position is the Start position or a leaf
if (i == START || greedy[i] > 0) {
// mark all reachable leaves from current leaf (or start position)
for (int j = 0; (i + fibs[j]) < GOAL; j++) {
// frog jumps "i+fibs[j]"
int jumpToIndex = i + fibs[j];
// reached goal (index of GOAL is GOAL-1)
// or reached a leaf
if (jumpToIndex == GOAL - 1 || A[jumpToIndex] == 1) {
// if current position is start, then the frog can reach the jumpToIndex leaf by 1 time jump
if (i == START) greedy[jumpToIndex] = 1;
// compute "Local optimal solution" of the leaf "A[jumpToIndex]"
else if (greedy[jumpToIndex] <= 0) greedy[jumpToIndex] = greedy[i] + 1;
else greedy[jumpToIndex] = Math.min(greedy[jumpToIndex], greedy[i] + 1);
}
}
}
}
return greedy[GOAL - 1] <= 0 ? -1 : greedy[GOAL - 1];
}
}
Conclusion
- Detected time complexity: O(N * log(N))
- Detected space complexity: O(N)
| Task Score | Correctness | Performance |
|---|---|---|
| 100% | 100% | 100% |