LeetCode 233 Number of Digit One

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

_我们的存在

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

阅读量455

点赞数 2

分类专栏： leetcode 文章标签： leetcode Math

本文链接：https://blog.csdn.net/Yano_nankai/article/details/50260527

版权

leetcode 专栏收录该内容

208 篇文章 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.

Hint:

Beware of overflow.

分析

参考：http://blog.csdn.net/xudli/article/details/46798619

代码

    public int countDigitOne(int n) {
        int ones = 0;
        for (long m = 1; m <= n; m *= 10) {
            long a = n / m, b = n % m;
            ones += (a + 8) / 10 * m;
            if (a % 10 == 1)
                ones += b + 1;
        }
        return ones;
    }