1. 不使用递归实现斐波那契数列
package zzh1;
public class java1 {
public static void main(String[] args) {
int n1 = 0, n2 = 1, n3, i, count = 10;
System.out.print(n1 + " " + n2);
for (i = 2; i < count; ++i)
{
n3 = n1 + n2;
System.out.print(" " + n3);
n1 = n2;
n2 = n3;
}
}
}
执行上面代码，得到如下结果
0 1 1 2 3 5 8 13 21 34
2. 使用递归实现斐波那契数列
package zzh1;
public class java1 {
static int n1 = 0, n2 = 1, n3 = 0;
static void printFibonacci(int count) {
if (count > 0) {
n3 = n1 + n2;
n1 = n2;
n2 = n3;
System.out.print(" " + n3);
printFibonacci(count - 1);
}
}
public static void main(String args[]) {
int count = 10;
System.out.print(n1 + " " + n2);
printFibonacci(count - 2);
}
}
执行上面代码，得到如下结果
0 1 1 2 3 5 8 13 21 34
转载请注明原文地址: https://ju.6miu.com/read-8519.html
