https://www.acmicpc.net/problem/2748

피보나치 수 2.java

import java.util.*;

public class Main {
    static long[] memo = new long[91];
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.print(fibo(sc.nextInt()));
    }
    static long fibo(int n){
        if (n<=1) return n;
        if (memo[n]!=0) return memo[n];
        memo[n] = fibo(n-1)+fibo(n-2);
        return memo[n];
    }
}