斐波那契数列,1,1,2,3,5,8,13,21,使用java输出此数列
时间: 2023-03-29 07:03:39 浏览: 83
可以使用以下代码输出斐波那契数列:
```
public class Fibonacci {
public static void main(String[] args) {
int n = 8; // 输出前8个数
int a = 1, b = 1;
System.out.print(a + " " + b + " ");
for (int i = 3; i <= n; i++) {
int c = a + b;
System.out.print(c + " ");
a = b;
b = c;
}
}
}
```
输出结果为:1 1 2 3 5 8 13 21
相关问题
java输出斐波那契数列的前 20 项:1,1,2,3,5,8,13,21…
可以使用递归或循环来输出斐波那契数列的前20项,以下是使用循环的示例代码:
```java
public class Fibonacci {
public static void main(String[] args) {
int n = 20, t1 = 0, t2 = 1;
System.out.print("斐波那契数列的前 " + n + " 项:");
for (int i = 1; i <= n; ++i) {
System.out.print(t1 + " + ");
int sum = t1 + t2;
t1 = t2;
t2 = sum;
}
}
}
```
输出结果为:斐波那契数列的前 20 项:0 + 1 + 1 + 2 + 3 + 5 + 8 + 13 + 21 + 34 + 55 + 89 + 144 + 233 + 377 + 610 + 987 + 1597 + 2584 + 4181 +
java输出1 1 2 3 5 8 13 21
这是斐波那契数列的前几项,可以使用Java代码实现:
```
public class Fibonacci {
public static void main(String[] args) {
int n = 8; // 输出前8项
int a = 1, b = 1;
System.out.print(a + " " + b + " ");
for (int i = 3; i <= n; i++) {
int c = a + b;
System.out.print(c + " ");
a = b;
b = c;
}
}
}
```
输出结果为:1 1 2 3 5 8 13 21