【Java】输出n项斐波那契数列

import java.util.Scanner;

public class 递归 {
	//求第n个斐波那契数
	static int fabnaci(int n) {
		if(n==0)return 0;
		if(n==1)return 1;
		return fabnaci(n-1)+fabnaci(n-2);
	}
public static void main(String[] args) {
	Scanner s =new Scanner(System.in);
	System.out.println("输入你想要的项数:\n");
	int n =s.nextInt();
	for(int i=0;i<n;i++) {
		System.out.println(fabnaci(i));
	}
}
}

猜你喜欢

转载自blog.csdn.net/qq_43416226/article/details/89439346