Leetcode 400. Nth Digit (Easy) (cpp)

最新推荐文章于 2021-12-01 19:47:36 发布

Niko_Ke

最新推荐文章于 2021-12-01 19:47:36 发布

阅读量628

点赞数

分类专栏： Leetcode C++ C++ Leetcode Math 文章标签： leetcode cpp

本文链接：https://blog.csdn.net/Niko_Ke/article/details/52630176

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode Math

40 篇文章 0 订阅

订阅专栏

Leetcode 400. Nth Digit (Easy) (cpp)

Tag: Math

Difficulty: Easy

/*

400. Nth Digit (Easy)

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