斐波那契数列递归实现
//斐波那契数列
public class FBNQDEmo {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
//输出数列的前a位数
int a = scanner.nextInt();
for (int i=1;i<a;i++){
System.out.println(play(i));
}
}
public static int play(int i){
if (i==1||i==2){
return 1;
}
return play(i-1)+play(i-2);
}
}