276. Paint Fence

问题描述

There is a fence with n posts, each post can be painted with one of the k colors.

You have to paint all the posts such that no more than two adjacent fence posts have the same color.

Return the total number of ways you can paint the fence.

Note:
n and k are non-negative integers.

题目链接：

---

思路分析

给有n个板板的篱笆上色，可以使用的颜色有k种。要求最多有两块相邻的板板的颜色相同，一共有多少上色方法。

首先排除边界条件，然后将上色方法分为两类：前两块板板颜色不同k*(k-1)，前两块颜色相同k。这样可以将上色方法分为两类。

下一块板可以继续不同，就有(different+same) * (k-1)；下一块板只有在不同的时候才能相同，same = different。循环即可。

代码

class Solution {
public:
    int numWays(int n, int k) {
        if (n == 0 || k == 0)
            return 0;
        if (n == 1)
            return k;
        int differentCount = k*(k-1);
        int sameCount = k;
        int temp;
        for (int i = 2; i < n; i++){
            temp = differentCount;
            differentCount = (differentCount + sameCount)*(k-1);
            sameCount = temp;
        }
        return differentCount + sameCount;
    }
};

时间复杂度：$O(n)$
空间复杂度：$O(1)$

---

反思

就是之前离散的东西啊，最多连续两位相同，有多少种编码方式。