版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/camary_niu/article/details/89485903
package cn.ns.logic; /** * 斐波那契数列 */ public class Fibonacci { /** * n为月份(这里默认n大于等于3) * @param n */ public static void getFibonacci(int n){ int[] arr = new int[n]; //已知前两个数 arr[0] = 1; arr[1] = 1; //递归生成数列 for (int i=2;i<n;i++){ arr[i] = arr[i-1] + arr[i-2]; } StringBuffer buffer = new StringBuffer(); for (int i = 0;i<arr.length;i++){ buffer.append(arr[i]+","); } buffer.deleteCharAt(buffer.length() - 1); System.out.println("斐波那契数列如下:"); System.out.println(buffer.toString()); } public static void main(String[] args){ getFibonacci(24); } }