백준알고리즘 2747번 피보나치 수

백준알고리즘

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

import java.util.Scanner;

public class Main2 {
    static int[] array;
    public static void main(String[] args) {
        Scanner scan = new Scanner (System.in);
        int calData = Integer.parseInt(scan.nextLine().trim());
        
        array = new int[calData + 1];
        System.out.println(calculate(calData));
        
        scan.close();
    }
    
    public static int calculate(int data) {
        if(data == 0) {
            array[data] = 0;
            
            return 0;
        }
        
        if(data == 1) {
            array[data] = 1;
            
            return 1;
        }
        
        if(array[data] > 0) {
            return array[data];
        }
        
        array[data] = calculate(data-1) + calculate(data-2);
        
        return array[data];
    }
}