每日一题

public class FibonacciSequence

{

public static void main(String[] args)

{

int n = 10; // 修改n的值以获取不同数量的斐波那契数列项数

System.out.println("斐波那契数列的前 " + n + " 项为：");

printFibonacci(n); }

public static void printFibonacci(int n)

{ int first = 1;

int second = 1;

int next; if (n == 1) {

System.out.println(first);

} else if (n == 2) {

System.out.println(first);

System.out.println(second); }

else { System.out.println(first);

System.out.println(second);

for (int i = 3; i <= n; i++)

{ next = first + second;

System.out.println(next);

first = second; second = next; }

}

}

}