function Fibosequence(n)
if n == 1 then
return 0
elseif n == 2 or n ==3 then --递归终止条件
return 1
else
return Fibosequence(n-2)+Fibosequence(n-1)
end
end
print("输入一个数字(求斐波那契数列):")
local a = io.read("*n")
for i = 1, a do
print(Fibosequence(i))
end
Lua递归打印斐波那契数列
最新推荐文章于 2024-06-06 14:29:19 发布