Day47| 198 打家劫舍 213 打家劫舍II 337 打家劫舍III

目录

198 打家劫舍  

213 打家劫舍II  

337 打家劫舍III

---

198 打家劫舍  

class Solution {
public:
    int rob(vector<int>& nums) {
        //dp数组表示当前的下标下的最大金额(金额也包括当前下标的金额)
        if(nums.size() == 0) return 0;
        if(nums.size() == 1) return nums[0];
        vector<int> dp(nums.size() + 1, 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  

class Solution {
public:
    int robRange(vector<int>& nums, int start, int end) {
        if(start == end) return nums[start];
        vector<int> dp(nums.size() + 1, 0);

        dp[start] = nums[start];
        dp[start + 1] = max(nums[start], nums[start + 1]);

        for (int i = 2; i <= end; i++) {
            dp[i] = max(dp[i - 1], dp[i - 2] + nums[i]);
        }
        return dp[end];
    }

    int rob(vector<int>& nums) {
        if (nums.size() == 0) return 0;
        if (nums.size() == 1) return nums[0];

        // 选首不选尾
        int shou = robRange(nums, 0, nums.size() - 2);
        // 选尾不选首
        int wei = robRange(nums, 1, nums.size() - 1);

        return max(shou, wei);
    }
};

337 打家劫舍III

class Solution {
public:
    int rob(TreeNode* root) {
        vector<int> result = robTree(root);
        return max(result[0], result[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);

        int val1 = cur->val + left[0] + right[0];
        int val2 = max(left[0], left[1]) + max(right[0], right[1]);
        
        return {val2, val1};
    }
};