問題
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.
制約
−1000 ≤ n ≤ 1000
例
入力:
n = 93
期待される出力:
expected = [93, 92, 91, 90, 89, 88]
入力:
long long n = 93;
期待される出力:
std::vector<long long> expected = {93, 92, 91, 90, 89, 88};
入力:
long n = 93;
期待される出力:
long[] expected = new long[] {93, 92, 91, 90, 89, 88};
解説
The clock goes 93, 92, 91, 90, 89, 88 and stops at 88 because its digits match.
入力:
n = 105
期待される出力:
expected = []
入力:
long long n = 105;
期待される出力:
std::vector<long long> expected = {};
入力:
long n = 105;
期待される出力:
long[] expected = new long[] {};
解説
105 is not a two-digit number from 11 to 99, so the answer is [].
解き方のヒント
まずは自分で考えてから、ヒントを 1 つずつ開いてみましょう。
ヒント 1
The tens digit is n / 10 and the ones digit is n % 10 with integer division.
ヒント 2
Add the current number to the result before checking whether to stop.
ヒント 3
Reject numbers outside 11 to 99 before the loop starts.
目安の計算量
O(1) time, O(1) extra space
参考資料
この課題はCodeUtility用に調整されています。上記の説明と制約に従ってください。