2018年7月30日
[leetcode] Number of Digit One
摘要： Given an integer n, count the total number of digit 1 appearing in all non-negative integers less than or equal to n. Example: Input: 13 Output: 6 Exp 阅读全文
posted @ 2018-07-30 22:27 Lin.B 阅读(163) 评论(0) 推荐(0)