Leetcode 400. Nth Digit (Easy) (cpp)
Tag: Math
Difficulty: Easy
/*
400. Nth Digit (Easy)
Find the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ...
Note:
n is positive and will fit within the range of a 32-bit signed integer (n < 231).
Example 1:
Input:
3
Output:
3
Example 2:
Input:
11
Output:
0
Explanation:
The 11th digit of the sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ... is a 0, which is part of the number 10.
*/
class Solution {
public:
int findNthDigit(int n) {
int d = 1, base = 1;
while ((long long)9 * base * d - n < 0) {
n -= 9 * base * d++;
base *= 10;
}
int num = --n / d + base;
for (int i = 1; i < d - n % d; i++) num /= 10;
return num % 10;
}
};