优化的fibonacci数列计算程序，可以较短时间计算出较大的数字-Fibonacci series, optimization program that can calculate the short time a large number of

输入一个数据n，计算斐波那契数列(Fibonacci)的第n个值 1 1 2 3 5 8 13 21 34 规律：一个数等于前两个数之和 //计算斐波那契数列(Fibonacci)的第n个值 -Enter a data n, calculate the Fibonacci series (Fibonacci) of the n-th value of 112,358,132,134 law: a number equal to the previous two numbers

利用递归方式的算法计算斐波那契数列各个项数-Recursively the algorithm to calculate the Fibonacci series of various number of items