代码随想录算法训练营第47天|198.打家劫舍 ● 213.打家劫舍II ● 337.打家劫舍III

  198.打家劫舍

class Solution {
public:
    int rob(vector<int>& nums) {
        if (nums.size() == 1) return nums[0];
        vector<int> dp(2, 0);
        dp[0] = 0;
        dp[1] = nums[0];
        for (int i = 1; i < nums.size(); i++) {
            int tmp = dp[0];
            dp[0] = max(dp[0], dp[1]);
            dp[1] = nums[i] + tmp;
        }
        return max(dp[0], dp[1]);
    }
};

213.打家劫舍II

class Solution {
public:
    int rob_sub(int start, int end, vector<int>& nums) {
        vector<int> dp(2, 0);
        dp[0] = 0;
        dp[1] = nums[start];
        for (int i = start + 1; i < end; i++) {
            int tmp = dp[0];
            dp[0] = max(dp[0], dp[1]);
            dp[1] = nums[i] + tmp;
        }
        return max(dp[0], dp[1]);
    }
    int rob(vector<int>& nums) {
        if (nums.size() == 1) return nums[0];
        return max(rob_sub(0, nums.size() - 1, nums), rob_sub(1, nums.size(), nums));
    }
};

337.打家劫舍III

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    vector<int> rub_sub(TreeNode* root) {
        if (root == nullptr) return {0, 0};
        vector<int> left = rub_sub(root->left);
        vector<int> right = rub_sub(root->right);
        int rob_father = root->val + left[0] + right[0];
        int rob_child = max(left[0], left[1]) + max(right[0], right[1]);
        return {rob_child, rob_father};
    }
    int rob(TreeNode* root) {
        vector<int> res = rub_sub(root);
        return max(res[0], res[1]);
    }
};