【算法/动态规划/打家劫舍问题】题解+详细备注(共3题)
class Solution {
public:
int rob(vector<int>& nums) {
int n = nums.size();
if(n == 1) return nums[0];
if(n == 2) return max(nums[0],nums[1]);
vector<int> dp(n);
dp[0] = nums[0];
dp[1] = max(nums[0],nums[1]);
for(int i = 2;i<n;++i){
dp[i] = max(dp[i-1],dp[i-2] + nums[i]);
}
return dp[n-1];
}
};
class Solution {
public:
int rob1(vector<int>& nums) {
int n = nums.size();
if(n == 1) return nums[0];
if(n == 2) return max(nums[0],nums[1]);
vector<int> dp(n);
dp[0] = nums[0];
dp[1] = max(nums[0],nums[1]);
for(int i = 2;i<n;++i){
dp[i] = max(dp[i-1],dp[i-2] + nums[i]);
}
return dp[n-1];
}
int rob(vector<int>& nums) {
int n = nums.size();
if(1 == n) return nums[0];
if(2 == n) return max(nums[0],nums[1]);
vector<int> nums1(nums.begin(),nums.end()-1);
vector<int> nums2(nums.begin()+1,nums.end());
return max(rob1(nums1),rob1(nums2));
}
};
class Solution {
public:
int rob(TreeNode* root) {
vector<int> result = robTree(root);
return max(result[0], result[1]);
}
vector<int> robTree(TreeNode* cur) {
if (cur == NULL) return vector<int>{0, 0};
vector<int> left = robTree(cur->left);
vector<int> right = robTree(cur->right);
int val1 = cur->val + left[0] + right[0];
int val2 = max(left[0], left[1]) + max(right[0], right[1]);
return {val2, val1};
}
};