题目链接https://leetcode.cn/problems/house-robber-ii/description/classSolution{public:introb(vectorintnums){intnnums.size();// 两种情况下的最大值returnmax(nums[0]rob1(nums,2,n-2),rob1(nums,1,n-1));}introb1(vectorintnums,intleft,intright){/*打家劫舍Ⅰ里的逻辑*/if(leftright)return0;// 1. 创建dp表intnnums.size();vectorintf(n);autogf;// 2. 初始化f[left]nums[left];// 3. 填表for(intileft1;iright;i){f[i]nums[i]g[i-1];g[i]max(f[i-1],g[i-1]);}// 4. 返回值returnmax(f[right],g[right]);}};
【动态规划】打家劫舍Ⅱ
发布时间：2026/6/5 23:05:23
题目链接https://leetcode.cn/problems/house-robber-ii/description/classSolution{public:introb(vectorintnums){intnnums.size();// 两种情况下的最大值returnmax(nums[0]rob1(nums,2,n-2),rob1(nums,1,n-1));}introb1(vectorintnums,intleft,intright){/*打家劫舍Ⅰ里的逻辑*/if(leftright)return0;// 1. 创建dp表intnnums.size();vectorintf(n);autogf;// 2. 初始化f[left]nums[left];// 3. 填表for(intileft1;iright;i){f[i]nums[i]g[i-1];g[i]max(f[i-1],g[i-1]);}// 4. 返回值returnmax(f[right],g[right]);}};
