标签：sys out div style new 斐波那契数列 else logs ==
public class FibonacciTset { 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(); } } }
方法二（数组）：
public class FibonacciTset { public static void main(String[] args) { int arr[] = new int[20]; arr[0] = arr[1] = 1; System.out.println("斐波那契数列前20项为："); System.out.print(arr[0] + "\t" + arr[1] + "\t"); for (int i = 2; i < arr.length; i++) { arr[i] = arr[i - 1] + arr[i - 2]; System.out.print(arr[i] + "\t"); if ((i + 1) % 5 == 0) System.out.println(); }
}
}
方法三（递归）：
public class FibonacciTset { // 使用递归方法 private static int getFibo(int i) { if (i == 1 || i == 2) return 1; else return getFibo(i - 1) + getFibo(i - 2); } public static void main(String[] args) { System.out.println("斐波那契数列的前20项为："); for (int j = 1; j <= 20; j++) { System.out.print(getFibo(j) + "\t"); if (j % 5 == 0) System.out.println(); } }
}
标签：sys out div style new 斐波那契数列 else logs ==
原文地址：http://www.cnblogs.com/liuzhenping/p/7527025.html
