[11727번] 2×n 타일링 2

✅ 점화식

✅ 코드

import java.util.Scanner;

public class Main {
	static int[] dp;

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		dp = new int[n + 1];

		dp[0] = 1;
		dp[1] = 1;

		for (int i = 2; i <= n; i++) {
			dp[i] = (dp[i - 1] + (2 * dp[i - 2])) % 10007;
		}

		System.out.println(dp[n]);

	}
}