打家劫舍DP-算法题

题意：给定若干相连房屋，大侠不能偷连续的两间房子，问大侠的最大收益
题解：简单DP
传送门

int rob(vector<int>& nums) {
    int size = nums.size();
    if (size == 0) return 0;
    if (size == 1) return nums[0];
    int first = nums[0], second = max(nums[0], nums[1]);
    for (int i = 2; i < size; i++) {
        int temp = second;
        second = max(first + nums[i], second);
        first = temp;
    }
    return second;
}

现在题意改成房屋为一个环，即头和尾是相连的
传送门

int robRange(vector<int>& nums, int start, int end) {
    int first = nums[start], second = max(nums[start], nums[start + 1]);
    for (int i = start + 2; i <= end; i++) {
        int temp = second;
        second = max(first + nums[i], second);
        first = temp;
    }
    return second;
}

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

现在题意改成一棵树
传送门

int rob(TreeNode* root) {
    unordered_map<TreeNode*, int> dp1, dp2;
    
    function<void(TreeNode*)> dfs = [&](TreeNode *p) {
        if (!p) return;
        dfs(p->left);
        dfs(p->right);
        dp1[p] = p->val + dp2[p->left] + dp2[p->right];
        dp2[p] = max(dp2[p->left], dp1[p->left]) + max(dp2[p->right], dp1[p->right]);
    };

    dfs(root);
    return max(dp1[root], dp2[root]);
}