[LeetCode 233] Number of Digit One

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

Mavs

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

阅读量823

点赞数

分类专栏： Java Leetcode 文章标签： leetcode math

本文链接：https://blog.csdn.net/sbitswc/article/details/48465961

版权

Leetcode 同时被 2 个专栏收录

287 篇文章 0 订阅

订阅专栏

Java

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

 public int countDigitOne(int n) {
        int res = 0, a = 1, b = 1;
        while (n > 0) {
            res += (n + 8) / 10 * a;
            if(n%10 == 1) res +=b;
            b += n % 10 * a;
            a *= 10;
            n /= 10;
        }
        return res;
    }