class Solution { public: int findNthDigit(int n) { int digCont = 1; //位数 long long start = 1, count = 9; // 0~9 10~99 100~999 while(n > count) { n -= count; digCont += 1; start *= 10; count = start * digCont * 9; } int num = start + (n - 1) / ...