lintcode - 房屋染色

 class Solution {
 public:
     /*
      * @param costs: n x 3 cost matrix
      * @return: An integer, the minimum cost to paint all houses
      */
      const int inf = 0x3f3f3f3f;
      vector<vector<int> > dp;
     int minCost(vector<vector<int>> &costs) {
         // write your code here'
         if(costs.size() == ) return ;
         dp.resize(costs.size(), vector<int>(,inf));
         for(int i = ; i < costs.size(); ++i){
                 for(int j = ; j < ; ++j){
                         if(i == ){
                                 dp[i][j] = costs[i][j];
                         } else {
                                 vector<int> tmp = color(j);
                                 dp[i][j] = min(dp[i-][tmp[]], dp[i-][tmp[]]) + costs[i][j];
                         }
                 }
         }
         return min(dp[costs.size() - ][], min(dp[costs.size() - ][], dp[costs.size() - ][]));
     }
     vector<int> color(int x){
         vector<int> y;
         if(x == ){
                 y.push_back();
                 y.push_back();
                 return y;
         } else if(x == ){
                 y.push_back();
                 y.push_back();
                 return y;
         } else {
                 y.push_back();
                 y.push_back();
                 return y;
         }
     }
 };