Programmers 멀리 뛰기

Answer

class Solution {

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