java递归实现斐波那契数列

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;


public class Main {
//用递归方式计算斐波那契数列
	public static void main(String[] args)throws IOException{

		Scanner sc=new Scanner(new BufferedReader(new InputStreamReader(System.in)));
		System.out.println("请输入要计算的斐波纳契数：");
		int m=sc.nextInt();
		System.out.println(fib(m));
	 
	}
	public static int fib(int n)
	{
		if(n==0)
		{
			return 1;
		}
		else if(n==1)
		{
			return 1;
		}
		else
		return fib(n-1)+fib(n-2);
	}
}