0220624/Project
/Python/14-15.py
# Python 14-15
# 14-14
def fib(n):
if n <= 1:
return n
else:
return fib(n-1) + fib(n-2)
n = int(input("请输入一个整数:"))
print(fib(n))
# 14-15
def fib(n):
if n <= 1:
return n
else:
return fib(n-1) + fib(n-2)
def sum(n):
if n <= 1:
return n
else:
return fib(n-1) + sum(n-1)
n = int(input("请输入一个整数:"))
print(sum(n))
/Python/11-12.py
# Python 11-12
# 11-11
def fib(n):
if n <= 1:
return n
else:
return fib(n-1) + fib(n-2)
def fibonacci(n):
if n <= 0:
return []
else:
fib = [0, 1]
for i in range(2, n+1):
fib.append(fib[i-1] + fib[i-2])
return fib
n = int(input("请输入一个整数:"))
print(fibonacci(n))
# 11-12
def fib(n):
if n <= 1:
return n
else:
return fib(n-1) + fib(n-2)
def fibonacci(n):
if n <= 0:
return []
elif n == 1:
return [0]
elif n == 2:
return [0, 1]
else:
fib = [0, 1]
for i in range(2, n+1):
fib.append(fib[i-1] + fib[i-2])
return fib
n = int(input("请输入一个整数:"))
print(fibonacci(n))
/Python/16-17.py
# Python 16-17
# 16-16
def fib(n):
if n <= 1:
return n
else:
return fib(n-1) + fib(n-2)
def fib(n):
if n <= 1:
return n
else:
a, b = 0, 1
for i in range(2, n+1):
a, b = b, a + b
return b
n = int(input("请输入一个整数:"))
print(fib(n))
# 16-17
def fib(n):
if n <= 1:
return n
else:
a, b = 0, 1
for i in range(2, n+1):
a, b = b, a + b
return b
def fib(n):
if n <= 1:
return n
else:
a, b = 0, 1
for i in range(2, n+1):
a, b = b, a + b
return b
def fib2(n):
if n == 0:
return 0
elif n == 1 or n == 2:
return 1
else:
a, b = 0, 1
for i in range(2, n+1):
a, b = b, a + b
return b
n = int(input("请输入一个整数:"))
print(fib(n))
/Python/13.py
# Python 13
# 13-12
def fib(n):
if n <= 1:
return n
else:
return fib(n-1) + fib(n-2)
def fib(n):
if n <= 1:
return n
else:
a, b = 0, 1
for i in range(2, n+1):
a, b = b, a + b
return b
n = int(input("请输入一个整数:"))
print(fib(n))
# 13-13
def fib(n):
if n <= 1:
return n
else:
a, b = 0, 1
for i in range(2, n+1):
a, b = b, a + b
return b
def fib(n):
if n == 0:
return 0
elif n == 1 or n == 2:
return 1
else:
a, b = 0, 1
for i in range(2, n+1):
a, b = b, a + b
return b
n = int(input("请输入一个整数:"))
print(fib(n))
/Python/2.py
# Python 2
# 2-1
def fib(n):
if n <= 1:
return n
else:
return fib(n-1) + fib(n-2)
def fibonacci(n):
if n <= 0:
return []
elif n == 1:
return [0]
elif n == 2:
return [0, 1]
else:
fib = [0, 1]
for i in range(2, n+1):
fib.append(fib[i-1] + fib[i-2])
return fib
n = int(input("请输入一个整