समस्या
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 के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।