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[1], nums[0]);
for (int i = 2; i < nums.size(); i++) {
dp[i] = max(dp[i - 1], dp[i - 2] + nums[i]);
}
return dp[nums.size() - 1];
}
};
213.打家劫舍II
class Solution {
public:
int rob(vector<int>& nums) {
if (nums.size() == 0) return 0;
if (nums.size() == 1) return nums[0];
int res1 = robRange(nums, 0, nums.size() - 2);
int res2 = robRange(nums, 1, nums.size() - 1);
return max(res1, res2);
}
int robRange(vector<int>& nums, int start, int end) {
if (start == end) return nums[start];
vector<int> dp(nums.size());
dp[start] = nums[start];
dp[start + 1] = max(nums[start], nums[start + 1]);
for (int i = start + 2; i <= end; i++) {
dp[i] = max(dp[i - 1], dp[i - 2] + nums[i]);
}
return dp[end];
}
};
337.打家劫舍III
class Solution {
public:
int rob(TreeNode* root) {
vector<int> res = robTree(root);
return max(res[0], res[1]);
}
vector<int> robTree(TreeNode *cur) {
if (cur == nullptr) return vector<int> {0, 0};
vector<int> ldp = robTree(cur->left);
vector<int> rdp = robTree(cur->right);
int val1 = cur->val + ldp[0] + rdp[0]; // 偷
int val2 = max(ldp[0], ldp[1]) + max(rdp[0], rdp[1]); // 不偷
return vector<int> {val2, val1};
}
};