Leetcode: Day 128, #256 #265 Paint House

Leetcode: Day 128, #256 #265 Paint House

Paint House There are a row of n houses, each house can be painted with one of the three colors: red, blue or green. The cost of painting each house with a certain color is different. You have to paint all the houses such that no two adjacent houses have the same color. The cost of painting each house with a certain color is represented by a  n x 3  is the cost of painting house 0 with color red; costs[1][2]  is the cost of painting house 1 with color green, and so on... Find the minimum cost to paint all houses. Note: ----------------------------------------- 递归：超时，可加memoization class Solution { public: int helper(vector>& costs, int index,int pre) { if (index == costs.size()) return 0; int min1 = INT_MAX,min2 = INT_MAX,min3 = INT_MAX; if (pre != 0) { min1 = costs[index][0] + helper(costs,index + 1,0); } if (pre != 1) { min2 = costs[index][1] + helper(costs,index + 1,1); } if (pre != 2) { min3 = costs[index][2] + helper(costs,index + 1,2); } return min(min(min2,min1),

Read full article from Leetcode: Day 128, #256 #265 Paint House