题目链接:https://leetcode.com/problems/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.
思路:可以分三步来做:
1.找出给定的n落在几位数的范围内
2.找到具体落在哪个数字
3.找出具体在哪一位上
分析可以得出一位有9个数字,二位数有90个数字,三位数有900个数,依次类推.因此可以每次增加一位数字,看n是否还在这个范围内.例如给定n = 150,首先一位有9个数字,所以位数可以+1,这样n-9 = 141. 然后2位的数字有2*90= 180,大于141,所以目标数字肯定是2位的.然后求具体落在哪个数字.可以用10+(141-1)/2 = 80求出.再求具体落在哪一位上,可以用(141-1)%2=0求出为第0位,即8.如此即可.
代码如下:
class Solution {
public:
int findNthDigit(int n) {
long digit = 1, ith = 1, base = 9;
while(n > base*digit)
{
n -= base*(digit++);
ith += base;
base *= 10;
}
return to_string(ith+(n-1)/digit)[(n-1)%digit]-'0';
}
};
参考:https://discuss.leetcode.com/topic/59314/java-solution/4