Day40 动态规划-打家劫舍 | LeetCode 198. 打家劫舍, 213. 打家劫舍 II, 337. 打家劫舍 III

LeetCode 198. 打家劫舍

每个dp[i] 考虑的是打劫第i家 or 不打劫第i家

如果打劫, dp[i] = dp[i - 2] + nums[i]

如果不打劫, dp[i] = dp[i - 1]

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];
    }
};

LeetCode 213. 打家劫舍 II

class Solution {
public:
    int rob(vector<int>& nums) {
        if(nums.size() == 1){
            return nums[0];
        }
        //分两种情况
        //取第一家和不取第一家两种的金额
        //case1
        vector<int> dp1(nums.size(), 0);
        dp1[0] = nums[0];
        dp1[1] = max(nums[0], nums[1]);
        for(int i = 2; i < nums.size() - 1; i++){
            dp1[i] = max(dp1[i - 1], dp1[i - 2] + nums[i]);
        }
        dp1[nums.size() - 1] = dp1[nums.size() - 2];

        //case2
        vector<int> dp2(nums.size(), 0);
        dp2[1] = nums[1];
        for(int i = 2; i < nums.size(); i++){
            dp2[i] = max(dp2[i - 1], dp2[i - 2] + nums[i]); 
        }
        return max(dp1[nums.size() - 1], dp2[nums.size() - 1]);
    }
};

LeetCode 337. 打家劫舍 III

class Solution {
public:

    pair<int,int> rob_Tree(TreeNode* cur){
        if(cur == nullptr){
            return make_pair(0, 0);
        }
        pair<int, int> left_rob = rob_Tree(cur->left);
        pair<int, int> right_rob = rob_Tree(cur->right);
        
        //偷当前节点
        int val1 = cur->val + left_rob.first + right_rob.first;
        //不偷当前节点
        int val2 = max(left_rob.first, left_rob.second) + max(right_rob.first, right_rob.second);
        return make_pair(val2, val1); 
    }

    int rob(TreeNode* root) {
        pair<int, int> result = rob_Tree(root);
        return max(result.first, result.second);
    }
};