Leetcode: Number of Digit One

Number of Digit One



Similar Problems:


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.

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.


// Blog link: https://code.dennyzhang.com/number-of-digit-one
linkedin
github
slack

Share It, If You Like It.

Leave a Reply

Your email address will not be published.