计算一个斐波那契数列中,包含多少个数字3
def feibo(n):
a,b,counter = 0, 1, 0
while (counter < n):
yield a
a,b =b, a + b # 先计算右边,再赋值,即b=1,a+b=0+1=1,再将计算的值赋值给左边
counter += 1
再将斐波那契数列中,含有多少个数字3计算出来。
def str_num(n):
num = 0
for i in feibo(n):
s = str(i)
for j in s:
if j == str(3):
num = num + 1
return num
例如,计算数列前10个数字中含有多少个3
看看前10个数字分别是什么
if __name__ == '__main__':
list1=[]
f = feibo(10)
for m in f:
list1.append(m)
print(list1)
print("前10个数中含有{0}个数字3".format(str_num(10)))