![在这里插入图片描述](https://img-blog.csdnimg.cn/direct/b0bc13b18e4047a98609783f690a3f89.png)
class Solution {
public:
int massage(vector<int>& nums) {
vector<int> dp(nums.size() + 3, 0);
for (int i = 3; i < nums.size() + 3; i++) {
dp[i] = nums[i - 3] + max(dp[i - 2], dp[i - 3]);
}
return max(dp[nums.size() + 2], dp[nums.size() + 1]);
}
};
![在这里插入图片描述](https://img-blog.csdnimg.cn/direct/6c23c7142995414e95a7dc0541b88ffb.png)
![在这里插入图片描述](https://img-blog.csdnimg.cn/direct/2b096dc408ea47eda20a2aa1bad40b25.png)
class Solution {
public:
int rob(vector<int>& nums) {
if (nums.size() == 1)
return nums[0];
if (nums.size() == 2)
return max(nums[0], nums[1]);
vector<int> f(nums.size());
vector<int> g(nums.size());
vector<int> f1(nums.size());
vector<int> g1(nums.size());
f[0] = nums[0], g[0] = 0;
for (int i = 1; i < nums.size() - 1; i++) {
f[i] = nums[i] + g[i - 1];
g[i] = max(f[i - 1], g[i - 1]);
}
f1[1] = nums[1], g1[1] = 0;
for (int i = 2; i < nums.size(); i++) {
f1[i] = nums[i] + g1[i - 1];
g1[i] = max(f1[i - 1], g1[i - 1]);
}
return max(max(f[nums.size() - 2], g[nums.size() - 2]),
max(f1[nums.size() - 1], g1[nums.size() - 1]));
}
};
class Solution {
public:
int rob(vector<int>& nums) {
if (nums.size() == 1)
return nums[0];
if (nums.size() == 2)
return max(nums[0], nums[1]);
vector<int> dp(nums.size() + 3, 0);
for (int i = 3; i < nums.size() + 2; i++) {
dp[i] = nums[i - 3] + max(dp[i - 2], dp[i - 3]);
}
vector<int> dp1(nums.size() + 3, 0);
for (int i = 4; i < nums.size() + 3; i++) {
dp1[i] = nums[i - 3] + max(dp1[i - 2], dp1[i - 3]);
}
return max(max(dp[nums.size()], dp[nums.size() + 1]),
max(dp1[nums.size() + 2], dp1[nums.size() + 1]));
}
};