문제
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
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에 맞게 수정되었습니다. 위의 설명과 제한 조건을 따르세요.