Leetcode 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.

public int findNthDigit(int n) {
        long digitsTotal = 0, tier = 1;
        while (digitsTotal < n) {
            digitsTotal += 9*(Math.pow(10,tier-1))*tier;
            tier++;
        }
        long x = digitsTotal - n;
        tier = tier -1;
        long numsMore = x / tier;
        long offset = x % tier;
        int biggest = (int)Math.pow(10,tier)-1;
        return String.valueOf(biggest-numsMore).charAt((int) (tier-1-offset)) - '0';
}