LeetCode | 400. Nth Digit 数学原理题

Find the n^th digitof 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-bitsigned integer (n < 2³¹).

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.

这一题纯粹考验基本功，首先判断给出的n所对应的数位是所对应的数字的第几位就是whatSide，然后判断是第几个数字，就是howMany，然后计算n所对应的数字是什么，通过这几个值就能直接得到结果

需要注意的是取模技巧的运用

class Solution {

public:

int findNthDigit(intn)

{

      long long collect = 0;

      long long tmp = 9;

      int u = 0;

      while (collect < n)

      {

            collect += tmp*(u+1);

            tmp *= 10;

            u++;

      }

      tmp /= 10;

      collect -= tmp*(u);

      n -= collect;

      int whatSide, howMany;

      whatSide = (n - 1) % u + 1;

      howMany = (n - 1) / u;

      tmp = 1;

      for (int i = 0; i < u - whatSide; i++)

            tmp *= 10;

      howMany /= tmp;

      howMany %= 10;

      if (whatSide == 1)

            return 1 + howMany;

      else

            return howMany;

}

};