java递归实现斐波那契数列

public class TestFib {
	public static void main(String[] args) {
		int n = f(5);
		System.out.println(n);
	}
	
	public static int f(int x){
		if(x==1 || x==2){
			return 1;
		}else{
			return f(x-1)+f(x-2);
		}
	}
}