Leetcode 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.

https://discuss.leetcode.com/topic/23426/o-n-time-java-solution-o-1-space/3

其实不难，动态规划的问题。

一开始没仔细看，以为是两两不重复，后来发现是间隔不重复，那么也就是一次考虑的是三位了。

于是乎，只要第一个和第三个不相同就行，那么要决定了第一个和第二个才来决定第三个，前面两个的情况又可以分成相同和不相同两种。

当前面俩色相同，第三个和第二个就需要不相同，如果前面两个不相同，第二个和第三个就可以重复，以此类推，可以根据第二个和第三个是不是相同的来决定第四个的颜色。。。

public class Solution {
    public int numWays(int n, int k) {
 
    if(n == 0) {return 0;
    else if(n == 1) return k;
    int diffColorCounts = k*(k-1);
    int sameColorCounts = k;
    for(int i=2; i<n; i++) {
        int temp = diffColorCounts;
        diffColorCounts = (diffColorCounts + sameColorCounts) * (k-1);
        sameColorCounts = temp;
    }
    return diffColorCounts + sameColorCounts;

    }
}