作者:s11ss | 时间:2007-12-16 23:04 | 标题:[原创js]斐波那契数列
//::::::::::::::::::::::::::Fibonacci Series {s11ss 2007-12-16}::::::::::::::::::::::::::
var host,re,n=new Array(),i,num;
//ScriptHost:
host=WScript.FullName;
host=host.substring(host.length-11,host.length).toLowerCase();
if(host=="wscript.exe") {
host=new ActiveXObject("WScript.Shell");
host.Run("cmd /ccscript/nologo \""+WScript.ScriptFullName+"\"");
WScript.Quit();
}
//Receive a number:
re=/^\d+$/gi;
while(!re.test(num)) {
WScript.Echo("Please input the total numbers:");
num=WScript.StdIn.ReadLine();
num=num.toString()-1;
}
//Calculate:
n=n=1;
for(i=2;i<=num;i++) n=n+n
//Print:
WScript.Echo("The Fibonacci Series:");
for(i=0;i<=num;i++) WScript.StdOut.Write(n+" ");
WScript.Stdin.ReadLine();
作者:kich | 时间:2007-12-26 19:21
能不能先文字描述下这数列是怎么回事?
作者:s11ss | 时间:2007-12-26 19:49
n[i]=n[i-1]+n[i-2]
最前面的两个数都是1,从第三个数起,一个数为前两个数之和。
如:
1 1 2 3 5 8 13