菲波那切数列java
时间: 2023-11-20 16:58:58 浏览: 34
以下是两种Java实现斐波那契数列的方法:
1. 递归方法实现斐波那契数列
```java
public class Fibonacci {
public static void main(String[] args) {
int n = 10;
for (int i = 0; i < n; i++) {
System.out.print(fibonacci(i) + " ");
}
}
public static int fibonacci(int n) {
if (n == 0 || n == 1) {
return n;
} else {
return fibonacci(n - 1) + fibonacci(n - 2);
}
}
}
```
2. 使用for循环实现斐波那契数列
```java
public class Fibonacci {
public static void main(String[] args) {
int n = 10;
int a = 0, b = 1;
for (int i = 0; i < n; i++) {
System.out.print(a + " ");
int sum = a + b;
a = b;
b = sum;
}
}
}
```