模拟卷Leetcode【剑指 Offer】Offer_43. 1～n 整数中 1 出现的次数

最新推荐文章于 2024-10-01 05:04:32 发布

邂逅模拟卷

最新推荐文章于 2024-10-01 05:04:32 发布

阅读量110

点赞数

分类专栏： # leetcode 文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/qq_34451909/article/details/121246727

版权

leetcode 专栏收录该内容

297 篇文章 2 订阅

订阅专栏

Offer_day31_43. 1～n 整数中 1 出现的次数

代码：

from leetcode_python.utils import *


class Solution:
    def __init__(self):
        pass

    def findNthDigit(self, n: int) -> int:
        save = [1, 10, 190, 2890, 38890, 488890, 5888890, 68888890, 788888890, 8888888890, 98888888890]
        for length, ans in enumerate(save):
            if n+1 > ans: continue
            elif n + 1 == ans: return 9 if n else 0
            else: break
        remain = n - save[length - 1]
        res_num = 10 ** (length - 1) + remain // length
        return int(str(res_num)[remain % length])



def test(data_test):
    s = Solution()
    return s.findNthDigit(*data_test)


def test_obj(data_test):
    result = [None]
    obj = Solution(*data_test[1][0])
    for fun, data in zip(data_test[0][1::], data_test[1][1::]):
        if data:
            res = obj.__getattribute__(fun)(*data)
        else:
            res = obj.__getattribute__(fun)()
        result.append(res)
    return result


if __name__ == '__main__':
    datas = [
        [100],
    ]
    for data_test in datas:
        t0 = time.time()
        print('-' * 50)
        print('input:', data_test)
        print('output:', test(data_test))
        print(f'use time:{time.time() - t0}s')