LV2 - 멀리뛰기

https://school.programmers.co.kr/learn/courses/30/lessons/12914#qna

프로그래머스

---

*답변

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