198.打家劫舍
class Solution {
public:
int rob(vector<int>& nums) {
if (nums.size() == 0) return 0;
if (nums.size() == 1) return nums[0];
vector<int> dp(nums.size(), 0);
dp[0]=nums[0];
dp[1] = max(nums[0], nums[1]);
for(int i=2; i<nums.size(); i++){
dp[i] = max(dp[i-1], dp[i-2]+nums[i]);
}
return dp[nums.size()-1];
}
};
参考文章:代码随想录- 198.打家劫舍
213.打家劫舍II
class Solution {
public:
int rob(vector<int>& nums) {
if (nums.size() == 0) return 0;
if (nums.size() == 1) return nums[0];
if (nums.size() == 2) return max(nums[0], nums[1]);
vector<int> dp(nums.size()-1, 0);
dp[0]=nums[0];
dp[1] = max(nums[0], nums[1]);
for(int i=2; i<nums.size()-1; i++){
dp[i] = max(dp[i-1], dp[i-2]+nums[i]);
}
vector<int> dp2(nums.size()-1, 0);
dp2[0]=nums[1];
dp2[1] = max(nums[1], nums[2]);
for(int i=2; i<nums.size()-1; i++){
dp2[i] = max(dp2[i-1], dp2[i-2]+nums[i+1]);
}
return max(dp[nums.size()-2], dp2[nums.size()-2]);
}
};
参考文章:代码随想录- 213.打家劫舍II
337.打家劫舍III
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<int> dfs(TreeNode* root){
if(root == nullptr) return vector<int>{0,0};
vector<int> left = dfs(root->left);
vector<int> right = dfs(root->right);
int val1 = root->val + left[1] +right[1];
int val2 = max(left[0],left[1])+max(right[0], right[1]);
return vector<int>{val1, val2};
}
int rob(TreeNode* root) {
vector<int> result = dfs(root);
return max(result[0], result[1]);
}
};
参考文章:代码随想录- 337.打家劫舍III