Problème
Write the positive integers one after another: 123456789101112131415... Position 1 holds 1, position 10 holds the 1 of 10, position 11 the 0 of 10. For each requested position, find the digit there. The positions go far past what you could build as a string: skip whole blocks of numbers with the same number of digits (9 one-digit numbers, 90 two-digit numbers, 900 three-digit numbers, ...).
Implement champernowne_digits(positions).
Input
positions: Positions in the digit string, counting from 1.
Output
Return the digit at each position, in the same order as the input. An empty input returns an empty list.
Contraintes
0 ≤ positions.length ≤ 100; 1 ≤ position ≤ 10^15
Exemples
Entrée :
positions = [1, 9, 10, 11]
Sortie attendue :
expected = [1, 9, 1, 0]
Entrée :
std::vector<long long> positions = {1, 9, 10, 11};
Sortie attendue :
std::vector<long long> expected = {1, 9, 1, 0};
Entrée :
long[] positions = new long[] {1, 9, 10, 11};
Sortie attendue :
long[] expected = new long[] {1, 9, 1, 0};
Explication
The string starts 1 2 3 4 5 6 7 8 9 1 0 1 1, so the digits are [1, 9, 1, 0].
Entrée :
positions = [15, 190]
Sortie attendue :
expected = [2, 1]
Entrée :
std::vector<long long> positions = {15, 190};
Sortie attendue :
std::vector<long long> expected = {2, 1};
Entrée :
long[] positions = new long[] {15, 190};
Sortie attendue :
long[] expected = new long[] {2, 1};
Explication
Position 15 is the 2 of 12. Positions 10 to 189 hold 10 to 99, so 190 is the first digit of 100: [2, 1].
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
Numbers with d digits take 9 × 10^(d − 1) × d positions in total.
Indice 2
Subtract whole blocks until the position falls inside one.
Indice 3
Within the block, (position − 1) / d tells you which number and (position − 1) % d which digit.
Complexité attendue
O(m × log P) time for m positions, O(m) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.