[Programmers] Lv2: 피보나치 수(12945)

문제

- 링크: https://school.programmers.co.kr/learn/courses/30/lessons/12945?language=java

 

풀이

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