leetcode Paint Fence

Problem

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.

Solution

dp[i]表示第 i 个栏杆满足条件的染色方案，那它就等于前一个栏杆颜色不同的方案数量（ dp[ i - 1] * (k -1) ）与 

前前一个栏杆颜色不同的方案数量（ dp[ i - 2] * (k -1)）之和

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