Write a nonrecursive version of the fibonacci. Fibonacci function can be seen in Fig. 6.29.
You need to input n to determine the number of test samples.
输入
3 3 4 5
输出
2 3 5
评测记录
优秀代码
