斐波那契数列
2008-10-30 16:53
260 查看
摘自《JAVA编程思想》第四版
class Fibonacci {
private int count = 0;
public Integer next(){
return fib(count++);
}
private int fib(int n){
if(n<2) return 1;
return fib(n-2)+fib(n-1);
}
public static void main(String args[]){
Fibonacci fib = new Fibonacci();
for(int i=0;i<18;i++)
System.out.println(fib.next());
}
}
class Fibonacci {
private int count = 0;
public Integer next(){
return fib(count++);
}
private int fib(int n){
if(n<2) return 1;
return fib(n-2)+fib(n-1);
}
public static void main(String args[]){
Fibonacci fib = new Fibonacci();
for(int i=0;i<18;i++)
System.out.println(fib.next());
}
}
相关文章推荐