Java中斐波那契数列
斐波那契数列:
斐波那契数列是指这样的一组数列(0,1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,2584,4181,6765,10946,17711,28657,46368…)
-
特别指出:第0项是0,第一项是第一个1,这个数列从第三个开始,每一项都等于前两项之和
代码:
public class FibonacciSequence {
public static void main(String[] args) {
for(int counter = 0;counter <=10;counter++){
System.out.printf("斐波那契数列的第%d个数是:%d\n",counter,fibonacci(counter));
}
}
public static long fibonacci(long number) {
if ((number == 0) || (number == 1)) {
return number;
} else {
return fibonacci(number - 1)+fibonacci(number - 2);
}
}
}
结果: