- //方法一 for循环
- public class FeiBoMethod{
- // 定义三个变量方法
- public static void main(String[] args) {
- int a = 1, b = 1, c = 0;
- System.out.println("斐波那契数列前20项为:");
- System.out.print(a + "\t" + b + "\t");
- //因为前面还有两个1、1 所以i<=18
- for (int i = 1; i <= 18; i++) {
- c = a + b;
- a = b;
- b = c;
- System.out.print(c + "\t");
- if ((i + 2) % 5 == 0)
- System.out.println();
- }
- }
- }
- //方法2 使用数组的方式实现
- public class FeiBoMethod {
- // 定义数组方法
- public static void main(String[] args) {
- int arr[] = new int[20];
- arr[0] = arr[1] = 1;
- for (int i = 2; i < arr.length; i++) {
- arr[i] = arr[i - 1] + arr[i - 2];
- }
- System.out.println("斐波那契数列的前20项如下所示:");
- for (int i = 0; i < arr.length; i++) {
- if (i % 5 == 0)
- System.out.println();
- System.out.print(arr[i] + "\t");
- }
- }
- }
- //递归实现
- public class FeiBoMethod {
- // 使用递归方法
- private static int getSum(int num) {
- if (num== 1 || num== 2)
- return 1;
- else
- return getSum(num- 1) + getFibo(num- 2);
- }
- public static void main(String[] args) {
- System.out.println("斐波那契数列的前20项为:");
- for (int i = 1; i <= 20; i++) {
- System.out.print(getSum(i) + "\t");
- if (i % 5 == 0)
- System.out.println();
- }
- }
- }