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.

  dp[3]=(k-1)*dp[1] + (k-1)*dp[2]
public class Solution {  
    public int numWays(int n, int k) {  
        if(n == 0 || k == 0)  
            return 0;  
        if(n == 1)  
            return k;  
        int lastS = k;  
        int lastD = k * (k - 1);  
        for(int i = 2; i < n; i++) {  
            int tempD = (k - 1) * (lastS + lastD);  
            lastS = lastD;  
            lastD = tempD;  
        }  
        return lastS + lastD;  
    }  
} 
最后编辑于
©著作权归作者所有,转载或内容合作请联系作者
平台声明:文章内容(如有图片或视频亦包括在内)由作者上传并发布,文章内容仅代表作者本人观点,简书系信息发布平台,仅提供信息存储服务。

推荐阅读更多精彩内容