基本思路:
找规律,自己没找透;
规律
具体代码:
class Solution {
public:
int findNthDigit(int n) {
if(n==0)
return 0;
int digit=1;
int num=1;
int count=9;
while(n>count){
n-=count;
digit++;
num*=10;
count=digit*num*9;
}
int cur=num+n/digit;
string s=to_string(cur);
return s[n%digit]-'0';
}
};