java代码之递归算法写斐波那契数列

java代码之递归算法写斐波那契数列

递归形式写法

package mylove.home.demo.t;

public class TestRecursive2 {
	public static void main(String[] args){
		for (int i = 0; i < 10; i++) {
			System.out.print(f(i)+",");
		}
	}
	private static int f(int n){
		if (n == 0) {
			return 0;
		}
		if (n ==2 || n == 1) {
			return 1;
		}else {
		    return f(n-1)+f(n-2);
		}
	}
}

输出结果

0,1,1,2,3,5,8,13,21,34,

数组递归形式

package mylove.home.demo.t;


public class TestRecursive {
	public static void main(String[] args) {
		//创建一维数组，设置值大小为 10
		int []arr = new int[10];
		
		arr[0] = 0;
		arr[1] = 1;
		arr[2] = 1;
		
		System.out.print(arr[0]+",");
		System.out.print(arr[1]+",");
		System.out.print(arr[2]+",");
		
		//遍历循环java的三位数之后的数列
	    for (int i = 3; i < 10; i++) {
	    	//使用递归算法
			arr[i] = arr[i-1] + arr[i-2];
			System.out.print(arr[i]+",");
		}
	}
}

输出结果

0,1,1,2,3,5,8,13,21,34,