计算数字k在0到n中的出现的次数,k可能是0~9的一个值
样例
例如n=12,k=1,在 [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12],我们发现1出现了5次 (1, 10, 11, 12)
-------------------------------------------------------------------------------------------------------------
class Solution:
# @param k & n two integer
# @return ans a integer
def digitCounts(self, k, n):
count = 0
for i in range(0,n+1):
s = str(i)
l = len(s)
#print(s,l)
for j in range(1,l+1):
if str(k) == s[j-1]:
count = count + 1
return count