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] = std::max(nums[0], nums[1]);
for (int i = 2; i < nums.size(); i++) {
dp[i] = std::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 ret1 = robRange(nums, 1, nums.size() - 1);
int ret2 = robRange(nums, 0, nums.size() - 2);
return std::max(ret1, ret2);
}
int robRange(vector<int>& nums, int left, int right) {
if (left == right) return nums[left];
vector<int> dp(nums.size(), 0);
dp[left] = nums[left];
dp[left+1] = std::max(nums[left], nums[left+1]);
for (int i = left + 2; i <= right; i++) {
dp[i] = std::max(dp[i-1], dp[i-2]+nums[i]);
}
return dp[right];
}
};
337. 打家劫舍 III
class Solution {
public:
int rob(TreeNode* root) {
vector<int> ret = robTree(root);
return std::max(ret[0], ret[1]);
}
/*
@ret: index = 0: 不偷 ; index = 1 偷
*/
vector<int> robTree(TreeNode* root) {
if (root == nullptr) return vector<int> {0, 0};
vector<int> left = robTree(root->left);
vector<int> right = robTree(root->right);
int val1 = root->val + left[0] + right[0]; // 偷当前层
int val2 = std::max(left[0], left[1]) + std::max(right[0], right[1]); // 不偷当前层
return {val2, val1};
}
};