- 软件开发
- python
实现斐波那契数列
def bf():
a
= 0
b
= 1
for i
in range(10):
z
= a
+ b
a
= b
b
= z
print(z
,end
=" ")
bf
()
递归实现斐波那契数列
for x
in range(10):
def func(n
):
if n
== 0 or n
== 1:
return 1
else:
return func
(n
- 1)+func
(n
- 2)
print(func
(x
),end
=" ")
递归实现阶乘 1 * 2 * 3 * 4 * 5 * 6 *…
def jiecheng(n
):
if n
== 1:
return 1
else:
return n
* jiecheng
(n
-1)
res
= jiecheng
(7)
print(res
)
