思路参考:https://discuss.leetcode.com/topic/59322/sharing-my-thinking-process
代码参考:https://discuss.leetcode.com/topic/59314/java-solution/14
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.
这道题一看到就有点懵,一点头绪都没有,感觉最近自己脑子都退化了 ̄□ ̄||。
看了下discuss,才有点懂了
首先,说一下思路:
1~9: 共有1*9=9
10~99:共有2*90=180
100~999:共有3*9000=2700
1000~9999:共有4*90000=360000
总结规律有:k * (9 * 10^k)
以12345为例:
9 + 180 + 2700 < 12345 < 9 + 180 + 2700 + 360000
故得出第12345个数肯定>1000
12345-9-180-2700=9456 9456-1=9455(因为从0开始计算)
所以第12345个数肯定在1000+(9455 / 4) = 3363里
9455%4=3,所以是3363的最后一位3
代码如下:
class Solution {
public int findNthDigit(int n) {
long count = 9;
int start = 1;
int len = 1;
while(n > count * len){
n -= count * len;
count *= 10;
len++;
start *= 10;
}
int num = start + (n - 1) / len;
String s = Integer.toString(num);
return Character.getNumericValue(s.charAt((n - 1) % len));
}
}