400. Nth Digit

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) {
        long base=9,digit=1;
        while(n-base*digit>0)
        {
            n-=base*digit;
            base*=10;
            digit++;
        }
        int index=n%digit;
        long num=1;

        if(index==0)
            index=digit;
        for(int i=1;i<digit;i++)
        {
            num*=10;
        }
        num+=(index==digit)? (n/digit-1):(n/digit);
        for(int i=index;i<digit;i++)
            num/=10;
        return num%10;



    }
};


这道题是别人ac的，他的解释如下：
To make the problem much much more easier, I divide the problem into 3 parts:

calculate how many digits the number has.
calculate what the muber is.
find out which digit in the number is we want.
You can find the relative code part in the code section.
Here is an example to help you to understand my code:

Example:

Input: 250

After step 1, you will find that the 250th digit must belong to a 3-digit number, since 1~9 can only provide 9 digits and 10~99 can only provide 180 digits. Here, n = 250 - 9 - 90 * 2 = 61, and digits = 3.

In step 2, we will find the target number, which named as number in my code. From step 1, the n becomes to 61, which means "the 61st digit in 3-digit number is the digit we are looking for ." Easily, we know the 61st digit in 3-digit number belongs to number = 100 + 61 / 3 = 100 + 20 = 120. index is the index of the target digit in number. If index equals to 0, it means the target digit is the last digit of number.

Step 3, from step 2, we know index = n % digits = 61 % 3 = 1, which means the target digit is the 1st digit in number. Then, return 1.

他的解法就是上面的代码。本来我也可以想到的，就是觉得用if else判断是有几位很麻烦。而他做的处理就是不断减去： n-=base*digit;这样比较方便