代码随想录算法训练营第四十七天| 198.打家劫舍、213.打家劫舍II、337.打家劫舍III

139.单词拆分

题目链接
文章讲解

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

213.打家劫舍II

题目链接
文章讲解

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

    int rob(vector<int>& nums) {
        if (nums.size() == 1) return nums[0];
        return max(robRange(nums, 0, nums.size() - 2), robRange(nums, 1, nums.size() - 1));
    }
};

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> robTree(TreeNode* root) { /*0: 偷当前节点最大金额*/ /*1: 不偷当前节点最大金额*/
        if (!root) return {0, 0};
        vector<int> dpLeft = robTree(root->left);
        vector<int> dpRight = robTree(root->right);
        return {root->val + dpLeft[1] + dpRight[1], max(dpLeft[0], dpLeft[1]) + max(dpRight[0], dpRight[1])};
    }

    int rob(TreeNode* root) {
        vector<int> dp = robTree(root);
        return max(dp[0], dp[1]);
    }
};