代码随想录算法训练营第40天

最新推荐文章于 2024-10-20 10:43:07 发布

m0_62262158

最新推荐文章于 2024-10-20 10:43:07 发布

阅读量213

点赞数 1

文章标签：算法 leetcode 职场和发展

本文链接：https://blog.csdn.net/m0_62262158/article/details/140439491

版权

LeetCode 198. 打家劫舍

链接

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] = nums[1];
        int money = max(dp[0], dp[1]);
        for(int i = 2; i < nums.size(); i++) {
            dp[i] = max(dp[i - 2], (dp[i - 1] - nums[i - 1])) + nums[i];
            money = max(money, dp[i]);
        }
        return money;
    }
};

LeetCode 213. 打家劫舍II

链接

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

    }
    int robRange(vector<int>& nums, int start, int end) {
        if(end == start) {
            return nums[start];
        }
        vector<int> dp(nums.size());
        dp[start] = nums[start];
        dp[start + 1] = max(nums[start], nums[start + 1]);
        for(int i = start + 2; i <= end; i++) {
            dp[i] = max(dp[i - 2] + nums[i], dp[i - 1]);
        }
        return dp[end];
    }
};

LeetCode 337. 打家劫舍III

链接

class Solution {
public:
    unordered_map<TreeNode*, int> umap;
    int rob(TreeNode* root) {
        if(root == nullptr) {
            return 0;
        }
        if(root->left == nullptr && root->right == nullptr) {
            return root->val;
        }
        if(umap[root]) {
            return umap[root];
        }
        int val_1 = root->val;
        if(root->left) {
            val_1 += rob(root->left->left) + rob(root->left->right);
        }
        if(root->right) {
            val_1 += rob(root->right->left) + rob(root->right->right);
        }
        int val_2 = rob(root->left) + rob(root->right);
        umap[root] = max(val_1, val_2);
        return max(val_1, val_2);
    }
};

class Solution {
public:
    int rob(TreeNode* root) {
        vector<int> res = robTree(root);
        return max(res[0], res[1]);
    }
    vector<int> robTree(TreeNode* cur) {
        if(cur == nullptr) {
            return vector<int>{0, 0};
        }
        vector<int> left = robTree(cur->left);
        vector<int> right = robTree(cur->right);
        // 不偷cur
        int val_0 = max(left[0], left[1]) + max(right[0], right[1]);
        // 偷cur
        int val_1 = cur->val + left[0] + right[0];
        return vector<int>{val_0, val_1};
    }
};