[JAVA/백준] 재귀: 피보나치 수 5

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
import java.util.Scanner;

/**
 * 
 * @author HEESOO
 *
 */
public class Main {
	public static int fib(int n){
		if(n==0) return 0;
		else if(n==1) return 1;
		else return fib(n-1)+fib(n-2);		
	}
	public static void main(String[] args) {
		Scanner input=new Scanner(System.in);
		int n=input.nextInt();
		System.out.println(fib(n));
		
	}
	
}