算法60天：day48

动态规划-打家劫舍

力扣链接

class Solution {
public:
    int rob(vector<int>& nums) {
        if(nums.size() == 0) return 0;
        if(nums.size() == 1) return nums[0];
        vector<int> dp(nums.size() , 0);
        dp[0] = nums[0];
        dp[1] = max(dp[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];
    }
};

动态规划-打家劫舍 II

力扣链接

class Solution {
public:
    int rob(vector<int>& nums) {
        if(nums.size() == 0) return 0;
        if(nums.size() == 1) return nums[0];
        int result1 = robRange(nums,0,nums.size() - 2);   //包含头结点，不包含尾结点
        int result2 = robRange(nums,1,nums.size() - 1);   //不包含头结点，包含尾结点
        return max(result1,result2);
    }

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

动态规划-打家劫舍 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:
    int rob(TreeNode* root) {
        vector<int> result = robTree(root);
        return max(result[0] , result[1]);
    }
    // vector<int>长度为2，0：代表不偷  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);
        //此结点不偷:此时可以选择偷/不偷左、右孩子，根据最大值来选择
        int val1 = max(left[0] , left[1]) + max(right[0] , right[1]);
        //此结点偷：此时左右孩子只能是不偷
        int val2 = cur->val + left[0] + right[0];
        return {val1,val2};
    }
};