Hard
Number of Digit One — Python
Full explanation · Time O(1) · Space O(1)
# Time: O(logn)
# Space: O(1)
class Solution(object):
def countDigitOne(self, n):
"""
:type n: int
:rtype: int
"""
DIGIT = 1
is_zero = int(DIGIT == 0)
result = is_zero
base = 1
while n >= base:
result += (n//(10*base)-is_zero)*base + \
min(base, max(n%(10*base) - DIGIT*base + 1, 0))
base *= 10
return result