阅读背景:

[算法系列之三十二]1的数目

来源:互联网 

题目

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.
Given an integer n, count the total n



你的当前访问异常,请进行认证后继续阅读剩余内容。

分享到: