Problème
Start with a positive integer and replace it by the sum of the squares of its digits. Keep doing that. If the number eventually becomes 1, the starting number is happy. Otherwise the process falls into a loop that never contains 1, and the number is unhappy. For example, 7 → 49 → 97 → 130 → 10 → 1, so 7 is happy.
Implement happy_number(n).
You need a way to notice that the sequence has started repeating, so the loop stops on unhappy numbers too.
Input
n: The starting number.
Output
Return true if the process reaches 1, otherwise false. The number 1 itself is happy.
Contraintes
1 ≤ n ≤ 10^9
Exemples
Entrée :
n = 19
Sortie attendue :
expected = True
Entrée :
long long n = 19;
Sortie attendue :
bool expected = true;
Entrée :
long n = 19;
Sortie attendue :
bool expected = true;
Explication
1² + 9² = 82, then 8² + 2² = 68, then 6² + 8² = 100, then 1² + 0² + 0² = 1, so 19 is happy: true.
Entrée :
n = 4
Sortie attendue :
expected = False
Entrée :
long long n = 4;
Sortie attendue :
bool expected = false;
Entrée :
long n = 4;
Sortie attendue :
bool expected = false;
Explication
4 → 16 → 37 → 58 → 89 → 145 → 42 → 20 → 4 repeats without ever reaching 1, so the answer is false.
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Write a helper that maps a number to the sum of the squares of its digits.
Indice 2
An unhappy number repeats a value it has already produced; remember the values you have seen.
Indice 3
The sequence drops below a few hundred very quickly, so the set stays small.
Complexité attendue
O(log n) steps per number, O(1) extra space with two pointers
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.