package com.suanfa.meituan;
import java.util.Scanner;
public class Test5 {
/**
* 描述:递归编程求斐波那契数列第n项
* 输入:
* 输出:
*/
public static int getResult(int n) {
if(n==1||n==2) {
return 1;
}
else{
return getResult(n-1)+getResult(n-2);
}
}
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
while(sc.hasNext()){
int n=sc.nextInt();
System.out.println(getResult(n));
}
}
}
import java.util.Scanner;
public class Test5 {
/**
* 描述:递归编程求斐波那契数列第n项
* 输入:
* 输出:
*/
public static int getResult(int n) {
if(n==1||n==2) {
return 1;
}
else{
return getResult(n-1)+getResult(n-2);
}
}
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
while(sc.hasNext()){
int n=sc.nextInt();
System.out.println(getResult(n));
}
}
}