Problema
A game show clock counts down from a two-digit number and stops as soon as both of its digits match, like 77 or 33. Starting from n, list every number the clock shows, including n itself and the matching number it stops on. If n already has matching digits, the clock shows only n.
Implement countdown_matching_digits(n).
Input
n: The starting number. It is valid from 11 to 99.
Output
Return the numbers from n down to the first number with two equal digits, in the order the clock shows them. If n is outside 11 to 99, return an empty list.
Restricciones
−1000 ≤ n ≤ 1000
Ejemplos
Entrada:
n = 93
Salida esperada:
expected = [93, 92, 91, 90, 89, 88]
Entrada:
long long n = 93;
Salida esperada:
std::vector<long long> expected = {93, 92, 91, 90, 89, 88};
Entrada:
long n = 93;
Salida esperada:
long[] expected = new long[] {93, 92, 91, 90, 89, 88};
Explicación
The clock goes 93, 92, 91, 90, 89, 88 and stops at 88 because its digits match.
Entrada:
n = 105
Salida esperada:
expected = []
Entrada:
long long n = 105;
Salida esperada:
std::vector<long long> expected = {};
Entrada:
long n = 105;
Salida esperada:
long[] expected = new long[] {};
Explicación
105 is not a two-digit number from 11 to 99, so the answer is [].
Cómo abordarlo
Inténtalo primero por tu cuenta y luego abre las pistas una a una.
Pista 1
The tens digit is n / 10 and the ones digit is n % 10 with integer division.
Pista 2
Add the current number to the result before checking whether to stop.
Pista 3
Reject numbers outside 11 to 99 before the loop starts.
Complejidad esperada
O(1) time, O(1) extra space
Referencias
Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.