首页 > 代码库 > 276. Paint Fence
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.
思路：最多两个相邻同色。之前不同色＊（k-1)＋之前同色＊(k-1)就是现在不同色的个数。最后输出现在不同色加现在同色的总个数。
public class Solution { public int numWays(int n, int k) { if(n<=0||k<=0) { return 0; } if(n==1) { return k; } int same=k; int diff=k*(k-1); for(int i=2;i<n;i++) { int pre=diff; diff=(diff+same)*(k-1); same=pre; } return diff+same; }}
276. Paint Fence
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。