斐波那契数列

最新推荐文章于 2024-11-21 22:08:10 发布

原创最新推荐文章于 2024-11-21 22:08:10 发布 · 146 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#J# #F#

Java 专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一个Java程序，该程序能够生成指定长度的斐波那契数列。通过一个名为Fibonacci的类中的静态方法f实现，输入一个整数参数，输出从数列起始位置开始的相应数量的斐波那契数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

The Question:

A Fibonacci sequence is the sequence of numbers 1, 1, 2, 3, 5, 8, 13, 21, 34, and so on, where each number (from the third on) is the sum of the previous two. Create a method that takes an integer as an argument and displays that many Fibonacci numbers starting from the beginning, e.g., If you run java Fibonacci 5 (where Fibonacci is the name of the class) the output will be: 1, 1, 2, 3, 5.

My Answer:

public class Fibonacci {

/**
* @param args
*/
static void f(int i){
if (i < 2)
System.out.println("The number you entered must be bigger than 1");
else{
int a[] = new int[i];
for(int j = 0;j < i;j++) {
a[0] =a[1] = 1;
if(j >= 2){
a[j] = a[j-1] +a[j-2];
}
System.out.print(a[j] + " ");
}
System.out.println();
}

}
public static void main(String[] args) {
// TODO Auto-generated method stub
Fibonacci.f(9);
Fibonacci.f(7);
Fibonacci.f(4);
}

}