没事应该研究一下算法,免得脑子秀逗~
如下,用递归的方式实现斐波那契数列
def calculateFibonacci(num)
if num==0 || num==1
1
else
calculateFibonacci(num-2)+calculateFibonacci(num-1)
end
end
result ||= []
10.times do |i|
result << calculateFibonacci(i)
end
p result
运行结果: