Number of Digit One

最新推荐文章于 2022-12-07 22:01:39 发布

cc不会飞

最新推荐文章于 2022-12-07 22:01:39 发布

阅读量433

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/bruce_teng2011/article/details/49909885

版权

leetcode 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n.

For example:
Given n = 13,

Return 6, because digit 1 occurred in the following numbers: 1, 10, 11, 12, 13.

3141092 a = 31410，b = 92，百位上1的个数为3141个100

3141192 a = 31411，b = 92，百位上1的个数为3141个100，外加100~192这93个数

3141594, a = 31415， b = 94，百位上1的个数为3141个100，外加100~199这100个数

总的公式(a+8) / 10 * m + (a % 10 == 1) * (b + 1)

class Solution(object):
    def countDigitOne(self, n):
        """
        :type n: int
        :rtype: int
        """
        m = 1
        sum = 0
        while m <= n:
            a = n / m
            b = n % m
            sum += (a+8) / 10 * m 
            if a % 10 == 1:
                sum += (b + 1)
            m *= 10
        return sum