怎样利用JAVA写出菲波纳奇数列“1,1,2,3,5,8,13,21....."这样的循环? java语言用递归输出Fibonacci数列:1 1 2 3...
\u600e\u6837\u7528Javascript\u7684\u5faa\u73af\u5199\u51fa1\u30011\u30012\u30013\u30015\u30018\u300113\u300121\uff1f\uff1ffunction d (n) {if (n>=1) {if (n==1 || n==2) {return 1;} else {return d(n-1)+d(n-2);}}}for (i=1; i<=8; i++) { //8\u8868\u793a\u5faa\u73af\u5199\u51fa8\u4e2a\u6570\uff0c\u8981\u5faa\u73af\u51e0\u4e2a\u5c31\u628a8\u6539\u6210\u51e0document.write(d(i)+' ');}
public class Fibonacci
{
public static void main(String[] args)
{
//\u521d\u59cb\u5316\u53d8\u91cf
int n0 = 1, n1 = 1, n2;
System.out.print(n0 + " " + n1 + " ");
//\u5f15\u5165for\u5faa\u73af\u4f9d\u6b21\u6267\u884c\u4e09\u4e2a\u8868\u8fbe\u5f0f,\u9650\u5b9ai\u7684\u53d6\u503c\u8303\u56f4\u4e3a<10
for (int i = 0; i < 10; i++)
{
//\u4e0b\u4e00\u4e2a\u6570\u662f\u65e9\u5148\u7684\u4e24\u4e2a\u6570\u7684\u548c
n2 = n1 + n0;
System.out.print(n2 + " ");
//\u65e9\u5148\u7684\u7b2c\u4e00\u4e2a\u6570\u6210\u4e3a\u65e9\u5148\u7684\u7b2c\u4e8c\u4e2a\u6570
n0 = n1;
//\u540c\u65f6\u5f53\u524d\u7684\u6570\u6210\u4e3a\u65e9\u5148\u7684\u6570
n1 = n2; // And current number becomes previous
}
System.out.println(); // Terminate the line
}
}
{
int d=20;//求前20个..
for(int a=1,b=0,i=0;i<d;i++)
{
int c=a+b; //求第3个数组等于第一个数字+第二个数字
System.out.println(c);//显示
a=b;//将第2个数字赋值给第1个数字
b=c;//将第3个数字赋值给第2个数字
}
}
//好了你可以试验一下..
前两个数相加
绛旓細public static void main(String[] args){ int d=20;//姹傚墠20涓..for(int a=1,b=0,i=0;i<d;i++){ int c=a+b; //姹傜3涓暟缁勭瓑浜庣涓涓暟瀛+绗簩涓暟瀛 System.out.println(c);//鏄剧ず a=b;//灏嗙2涓暟瀛楄祴鍊肩粰绗1涓暟瀛 b=c;//灏嗙3涓暟瀛楄祴鍊肩粰绗2涓暟瀛 } } //...