Fork me on GitHub
2016年3月13日
【LeetCode】233. 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. For example: Given n = 13, Retur 阅读全文
posted @ 2016-03-13 16:37 __Neo 阅读(167) 评论(0) 推荐(0) 编辑