[lv2] 멀리 뛰기

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

 

기본 dp 문제

class Solution {
    public long solution(int n) {
        long answer = 0;
        long mod = 1234567;

        int[] dp = new int[n+1];

        dp[1] = 1;

        if(n > 1)
            dp[2] = 2;

        for(int i=3; i<=n; i++) {

            dp[i] += dp[i-1];
            dp[i] += dp[i-2];
            dp[i] %= mod;
        }

        return dp[n];
    }
}