프로그래머스-멀리뛰기

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