2×n 타일링

https://www.acmicpc.net/problem/11726

11726번: 2×n 타일링

 

public class Problem11726 {
    private static int MOD_NUMBER = 10007;

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

        System.out.println(solve(n));
    }

    private static int solve(int n) {
        int[] tiles = new int[n+1];

        for (int i = 0; i <= n; i++) {
            tiles[i] = getTiles(i, tiles) % MOD_NUMBER;
        }

        return tiles[n];
    }

    private static int getTiles(int n, int[] tiles) {
        if (n <= 2) {
            return n;
        } else {
            return tiles[(n-1) + tiles[(n-2)]];
        }
    }
}