Problema
From any positive n, the Collatz rule makes the next term n / 2 when n is even and 3n + 1 when n is odd, and the chain stops when it reaches 1. The chain for 6 is 6, 3, 10, 5, 16, 8, 4, 2, 1: nine terms. Among all starting numbers from 1 to limit, find the one with the most terms.
Implement longest_collatz_chain(limit).
Chains share their endings, so remembering the length found for each number saves a lot of work. Terms along the way can pass the limit; use 64-bit integers.
Input
limit: The largest starting number to try.
Output
Return the starting number whose chain has the most terms (counting the start and the final 1). If several tie, return the smallest of them.
Restricciones
1 ≤ limit ≤ 100,000
Ejemplos
Entrada:
limit = 6
Salida esperada:
expected = 6
Entrada:
long long limit = 6;
Salida esperada:
long long expected = 6;
Entrada:
long limit = 6;
Salida esperada:
long expected = 6;
Explicación
The chain lengths for 1 to 6 are 1, 2, 8, 3, 6 and 9 terms, so the answer is 6.
Entrada:
limit = 10
Salida esperada:
expected = 9
Entrada:
long long limit = 10;
Salida esperada:
long long expected = 9;
Entrada:
long limit = 10;
Salida esperada:
long expected = 9;
Explicación
9 gives 20 terms (9, 28, 14, 7, ...), more than any other start up to 10, so the answer is 9.
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
Count the terms of one chain first, including the start and the 1.
Pista 2
When a chain reaches a number whose length you already know, add instead of continuing.
Pista 3
Only replace the best start when a length is strictly greater.
Complejidad esperada
O(limit × average new steps) time, O(limit) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.