Problema
The Lucas numbers follow the same rule as the Fibonacci numbers, each term being the sum of the two before it, but they start differently: L(0) = 2 and L(1) = 1. The sequence goes 2, 1, 3, 4, 7, 11, 18, 29, …
Implement lucas_numbers(n).
Input
n: The index of the term, starting at 0.
Output
Return L(n).
Vincoli
0 ≤ n ≤ 90
Esempi
Input:
n = 6
Output atteso:
expected = 18
Input:
long long n = 6;
Output atteso:
long long expected = 18;
Input:
long n = 6;
Output atteso:
long expected = 18;
Spiegazione
The terms are 2, 1, 3, 4, 7, 11, 18, so L(6) = 18.
Input:
n = 0
Output atteso:
expected = 2
Input:
long long n = 0;
Output atteso:
long long expected = 2;
Input:
long n = 0;
Output atteso:
long expected = 2;
Spiegazione
The sequence starts with L(0) = 2.
Come affrontarlo
Prova prima da solo, poi apri un suggerimento alla volta.
Suggerimento 1
Keep the current and next terms in two variables.
Suggerimento 2
The only difference from Fibonacci is the start: 2 and 1.
Suggerimento 3
For n = 90 the next term would not fit in 64 bits, so stop the loop at n.
Complessità attesa
O(n) time, O(1) extra space
Riferimenti
Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.