Paint Fence

标签：int   ati   bsp   ace   more   sts   paint   cto   number   

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.

 1 class Solution {
 2 public:
 3     int numWays(int n, int k) {
 4         vector<int> dp(n + 1, 0);
 5         dp[1] = k;
 6         dp[2] = k * k;
 7         
 8         for (int i = 3; i <= n; i++) {
 9             dp[i] = (k - 1) * (dp[i - 1] + dp[i - 2]);
10         }
11         return dp[n];
12     }
13 };

Paint Fence

标签：int   ati   bsp   ace   more   sts   paint   cto   number   

原文地址：http://www.cnblogs.com/amazingzoe/p/6028845.html