S*******C
发帖数: 822 | 1 一道career cup、leetcode的原题变种，也是lintcode原题，但目前没有发现无bug的
最优解，所有中国人都做错了，或者明显是非最优解
leetcode上是
Number of Digit One My Submissions Question
Total Accepted: 12345 Total Submissions: 55909 Difficulty: Medium
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.
https://leetcode.com/problems/number-of-digit-one/
最精简最优解是
public int co... 阅读全帖 |
|
