Fibonacci数列的递归简单实现

public class Fibonacci 
{
	public int method(int x)
	{
	
		if(x==2||x==1)
			return 1;
		else
			return method(x-1)+method(x-2);
		
	}
	public static void main(String args[])
	{
		Fibonacci fb=new Fibonacci();
		System.out.print(fb.method(5));
	}
}