https://leetcode-cn.com/problems/nth-digit/
思路:规律
int findNthDigit(int n) {
if (n < 10) {
return n;
}
long long num = 9, i = 1;
while(n - num >= 0) {
n = n - num;
i += 1;
num = 9 * pow(10, i - 1) * i;
}
int temp_value = (n - 1) / i + pow(10, i - 1);
strint s = to_string(temp_value);
if (n % i == 0) {
return s[i - 1] - '0';
}
return s[n % i - 1] - '0';
}