题目:求出1~13的整数中1出现的次数,并算出100~1300的整数中1出现的次数?为此他特别数了一下1~13中包含1的数字有1、10、11、12、13因此共出现6次,但是对于后面问题他就没辙了。ACMer希望你们帮帮他,并把问题更加普遍化,可以很快的求出任意非负整数区间中1出现的次数(从1 到 n 中1出现的次数)。
牛客网:链接
参考链接:点这里呀
# -*- coding:utf-8 -*-
class Solution:
def NumberOf1Between1AndN_Solution(self, n):
# write code here
mult, sumTimes = 1, 0
while n // mult:
'''返回一个包含商和余数的元组'''
high, mod = divmod(n, mult*10)
curNum, low = divmod(mod, mult)
if curNum > 1:
sumTimes += high * mult + mult
elif curNum == 1:
sumTimes += high * mult + low + 1
else:
sumTimes += high * mult
mult = mult * 10
return sumTimes
扩展版,求整数中X出现的次数(从1到n中个位数X出现的次数)
# -*- coding:utf-8 -*-
class Solution:
def NumberOf1BetweenXAndN_Solution(self, n, x):
mult, sumTimes = 1, 0
while n//mult > 0:
high, mod = divmod(n, mult*10)
curNum, low = divmod(mod, mult)
if curNum > x:
sumTimes += high*mult + mult
elif curNum == x:
sumTimes += high*mult + low + 1
else:
sumTimes += high*mult
mult = mult*10
return sumTimes