programmers_피보나치 수_java

https://school.programmers.co.kr/learn/courses/30/lessons/12945

프로그래머스

class Solution {
    
    final int MOD = 1234567;
    
    public int solution(int n) {
        int answer = 0;
        
        long[] fibo = new long[n+1];
        fibo[0] = 0;
        fibo[1] = 1;
        fibo[2] = 1;
        
        for(int i = 3; i<=n; i++){
            fibo[i] = (fibo[i-1]+ fibo[i-2])%MOD;
        }
        
        answer = (int)fibo[n];
        
        return answer;
    }
}