Problema
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.
Restrições
1 ≤ n ≤ 10^9
Exemplos
Entrada:
n = 19
Saída esperada:
expected = True
Entrada:
long long n = 19;
Saída esperada:
bool expected = true;
Entrada:
long n = 19;
Saída esperada:
bool expected = true;
Explicação
1² + 9² = 82, then 8² + 2² = 68, then 6² + 8² = 100, then 1² + 0² + 0² = 1, so 19 is happy: true.
Entrada:
n = 4
Saída esperada:
expected = False
Entrada:
long long n = 4;
Saída esperada:
bool expected = false;
Entrada:
long n = 4;
Saída esperada:
bool expected = false;
Explicação
4 → 16 → 37 → 58 → 89 → 145 → 42 → 20 → 4 repeats without ever reaching 1, so the answer is false.
Como abordar
Tente sozinho primeiro e depois abra uma dica de cada vez.
Dica 1
Write a helper that maps a number to the sum of the squares of its digits.
Dica 2
An unhappy number repeats a value it has already produced; remember the values you have seen.
Dica 3
The sequence drops below a few hundred very quickly, so the set stays small.
Complexidade esperada
O(log n) steps per number, O(1) extra space with two pointers
Referências
Este desafio foi adaptado para o CodeUtility. Siga o enunciado e as restrições acima.