题目链接https://leetcode.cn/problems/JEj789/description/classSolution{public:intminCost(vectorvectorintcosts){/*时空复杂度O(n)*/intncosts.size();// 1. 创建dp表 (n 1) * 3vectorvectorintdp(n1,vectorint(3));// 2. 初始化// 3. 填表for(inti1;in;i){dp[i][0]costs[i-1][0]min(dp[i-1][1],dp[i-1][2]);dp[i][1]costs[i-1][1]min(dp[i-1][0],dp[i-1][2]);dp[i][2]costs[i-1][2]min(dp[i-1][1],dp[i-1][0]);}// 4. 返回值returnmin(dp[n][1],min(dp[n][2],dp[n][0]));}};
【动态规划】粉刷房子
题目链接https://leetcode.cn/problems/JEj789/description/classSolution{public:intminCost(vectorvectorintcosts){/*时空复杂度O(n)*/intncosts.size();// 1. 创建dp表 (n 1) * 3vectorvectorintdp(n1,vectorint(3));// 2. 初始化// 3. 填表for(inti1;in;i){dp[i][0]costs[i-1][0]min(dp[i-1][1],dp[i-1][2]);dp[i][1]costs[i-1][1]min(dp[i-1][0],dp[i-1][2]);dp[i][2]costs[i-1][2]min(dp[i-1][1],dp[i-1][0]);}// 4. 返回值returnmin(dp[n][1],min(dp[n][2],dp[n][0]));}};
