方法:动态规划
class Solution {
public int countHousePlacements(int n) {
//状态:dp[i] 表示有i个地块时的放置房子方式数
long[] dp = new long[n + 1];
dp[0] = 1;
dp[1] = 2;
for (int i = 2; i <= n; i++) {
dp[i] = (dp[i - 1] + dp[i - 2]) % 1000000007;
}
return (int)(dp[n] * dp[n] % 1000000007);
}
}