本文介绍了一个简单的Python程序，用于生成斐波那契数列，并通过一个具体实例展示了如何使用循环结构来实现数列的计算。此程序能够帮助读者理解递归原理及其在实际编程中的应用。
n = int(raw_input())
first = 0
second = 1
f = [0]
num = 0
while num < 51:
first, second = second, first + second
f.append(first)
num += 1
print f[n]
first = 0
second = 1
f = [0]
num = 0
while num < 51:
first, second = second, first + second
f.append(first)
num += 1
print f[n]
扫一扫
2579
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
