什么是斐波那契数列?
这个数列从第3项开始,每一项都等于前两项之和
格式:1,1,2,3,5,8,13,21。。。。。
思路:
1.利用交换的形式,两个值相加以后等于第三者,然后将第三者的值赋值给第二者,不断循环
2.利用递归
代码:
public class FeiBoNaQiShuLie {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.println("请输入要打印的斐波那契数列的个数:");
int count = scanner.nextInt();
fun(count);
getNumber(count);
}
public static void getNumber(int count) {
System.out.println();
System.out.println("使用递归方式执行:");
for (int i = 1; i <= count; i++) {
System.out.print(digui(i)+"\t");
}
}
public static int digui(int num) {
if (num == 1 || num == 2) {
return 1;
} else {
return digui(num - 1) + digui(num - 2);
}
}
public static void fun(int count) {
System.out.println("利用交换的方式执行:");
int x = 1;
int y = 1;
int z = 0;
for (int i = 1; i <= count; i++) {
if (i == 1 || i == 2) {
System.out.print(1 + "\t");
} else {
z = x + y;
x = y;
y = z;
System.out.print(z + "\t");
}
}
}
}