代码随想录day39 198.打家劫舍 213.打家劫舍II 337.打家劫舍III
代码随想录
class Solution {
public:
int rob(vector<int>& nums) {
int size = nums.size();
if (size == 1) {
return nums[0];
}
vector<int> dp(size);
dp[0] = nums[0];
dp[1] = max(nums[0], nums[1]);
for (int i = 2; i < size; i++) {
dp[i] = max(dp[i - 1], dp[i - 2] + nums[i]);
}
return dp[size - 1];
}
};
代码随想录
class Solution {
public:
int robRange(vector<int> & nums, int start, int end) {
int size = end - start + 1;
if (size == 1) {
return nums[start];
}
vector<int> dp(size);
dp[0] = nums[start];
dp[1] = max(nums[start], nums[start + 1]);
for (int i = 2; i < size; i++) {
dp[i] = max(dp[i - 1], dp[i - 2] + nums[start + i]);
}
return dp[size - 1];
}
int rob(vector<int>& nums) {
if (nums.size() == 1) {
return nums[0];
}
int res = max(robRange(nums, 0, nums.size() - 2),robRange(nums, 1, nums.size() - 1));
return res;
}
};
代码随想录
class Solution {
public:
vector<int> robTree(TreeNode * root) {
if (root == nullptr) {
return vector<int>{0, 0};
}
vector<int> leftDp = robTree(root->left);
vector<int> rightDp = robTree(root->right);
int rightValue = root->val + leftDp[0] + rightDp[0];
int leftValue = max(leftDp[0], leftDp[1]) + max(rightDp[0], rightDp[1]);
return vector<int>{leftValue, rightValue};
}
int rob(TreeNode* root) {
vector<int> res = robTree(root);
return max(res[0], res[1]);
}
};