198-打家劫舍
题目链接:LeetCode-198中等
思考
dp[i]取最大值,即dp[i] = max(dp[i - 2] + nums[i], dp[i - 1]);
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());
dp[0]=nums[0];
dp[1]=max(nums[0],nums[1]);
for(int i=2;i<nums.size();i++){
dp[i]=max(dp[i-2]+nums[i],dp[i-1]);
}
return dp[nums.size()-1];
}
};
213-打家劫舍II
题目链接:LeetCode-213中等
思考
环形问题分类讨论
情况一:无首元素&尾元素(情况二和三包含情况一)
情况二:无首元素 1 ~ num.size()-1
请款三:无尾元素 0 ~ nums.size()-2
class Solution {
public:
int rob(vector<int>& nums) {
if (nums.size() == 0) return 0;
if (nums.size() == 1) return nums[0];
int result2 = robRange(nums, 1, nums.size() - 1); // 情况二
int result1 = robRange(nums, 0, nums.size() - 2); // 情况三
return max(result1, result2);
}
// 198.打家劫舍的逻辑
int robRange(vector<int>& nums, int start, int end) {
if (end == start) 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 - 2] + nums[i], dp[i - 1]);
}
return dp[end];
}
};
337-打家劫舍III
题目链接:LeetCode-337中等
思考
class Solution {
public:
int rob(TreeNode* root) {
vector<int> result = robTree(root);
return max(result[0], result[1]);
}
// 长度为2的数组,0:不偷,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);
// 偷cur
int val1 = cur->val + left[0] + right[0];
// 不偷cur
int val2 = max(left[0], left[1]) + max(right[0], right[1]);
return {val2, val1};
}
};