198.打家劫舍
题目链接:198.打家劫舍
文档链接:198.打家劫舍
视频链接:动态规划,偷不偷这个房间呢?| LeetCode:198.打家劫舍
C++实现
class Solution {
public:
int rob(vector<int>& nums) {
if(nums.size() == 1) return nums[0];
vector<int> dp(nums.size(), 0);
dp[0] = nums[0];
dp[1] = max(nums[0], nums[1]);
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
题目链接:213.打家劫舍II
文档链接:213.打家劫舍II
视频链接:动态规划,房间连成环了那还偷不偷呢?| LeetCode:213.打家劫舍II
C++实现
class Solution {
private:
int lineRob(vector<int>& nums, int start, int end){
if(start == end) return nums[start];
vector<int> dp(end - start + 1, 0);
dp[0] = nums[start];
dp[1] = max(nums[start], nums[start + 1]);
for(int i = 2; i<dp.size();i++){
dp[i] = max(dp[i -1], dp[i -2] + nums[start + i]);
}
return dp[end -start];
}
public:
int rob(vector<int>& nums) {
if(nums.size() == 0) return 0;
if(nums.size() == 1) return nums[0];
int result1 = lineRob(nums, 0, nums.size() -2);
int result2 = lineRob(nums, 1, nums.size() -1);
return max(result1, result2);
}
};
337.打家劫舍III
题目链接:337.打家劫舍III
文档链接:337.打家劫舍III
视频链接:动态规划,房间连成树了,偷不偷呢?| LeetCode:337.打家劫舍3
C++实现
class Solution {
private:
vector<int> traversal(TreeNode* node){
if(node == NULL) return vector<int>{0,0};
vector<int> left = traversal(node->left);
vector<int> right = traversal(node->right);
int val1 = max(left[0], left[1]) + max(right[0], right[1]);
int val2 = node->val + left[0] + right[0];
return {val1, val2};
}
public:
int rob(TreeNode* root) {
vector<int> result = traversal(root);
return max(result[0], result[1]);
}
};