数字序列中某一位的数字

数字以01234567891011121314……的格式序列化到一个字符序列中。求任意第n位数字对应的数字。

#include <iostream>

#include <algorithm>
using namespace std;
int countOfIntegers(int digits);
int digitAtIndex(int index, int digits);
int beginNumber(int digits);
int digitAtIndex(int index)
{
if (index < 0)
return -1;
int digits = 1;
while (true)
{
int numbers = countOfIntegers(digits);
if (index < numbers * digits)
return digitAtIndex(index, digits);
index -= digits * numbers;
digits++;
}
return -1;
}
int countOfIntegers(int digits)
{
if (digits == 1)
return 10;
int count = (int)std::pow(10, digits - 1);
return 9 * count;
}
int digitAtIndex(int index, int digits)
{
int number = beginNumber(digits) + index / digits;
int indexFromRight = digits - index % digits;
for (int i = 1; i < indexFromRight; ++i)
number /= 10;
return number % 10;
}
int beginNumber(int digits)
{
if (digits == 1)
return 0;
return (int)std::pow(10, digits - 1);
}
int main()
{
int n;
cin >> n;
int result;
result = digitAtIndex(n);
cout << result;
system("pause");
return 0;
}