写出斐波那契数列前20项
package com.qianfeng.weekendDay01;
public class WeekendWork05 {
public static void main(String[] args) {
int number1 = 1,number2 = 1;
int transfers; //储存中转数
System.out.print(number1 + "\t" + number2 + "\t");
for (int i = 3; i <= 20; i++) {
transfers = number1;
number1 = number1 + number2;
number2 = transfers;
System.out.print(number1 + "\t");
if(i % 5 == 0) {
System.out.println();
}
}
}
}
本文通过Java代码展示了如何生成斐波那契数列的前20项,并使用了简单的迭代方法来实现这一过程。代码易于理解,适合初学者学习。
1045





