LeetCode | 337. House Robber III-CSDN博客

本文链接：https://blog.csdn.net/iLOVEJohnny/article/details/119282407

本文介绍了一位聪明的小偷如何利用二叉树结构的住宅区进行盗窃，避免夜间同时闯入直接相连的房屋被警察发现。通过给出根节点，挑战在于计算小偷能窃取的最大金额而不触动警报。算法探讨了深度优先搜索策略和最优路径选择。

摘要由CSDN通过智能技术生成

题目

The thief has found himself a new place for his thievery again. There is only one entrance to this area, called root.

Besides the root, each house has one and only one parent house. After a tour, the smart thief realized that all houses in this place form a binary tree. It will automatically contact the police if two directly-linked houses were broken into on the same night.

Given the root of the binary tree, return the maximum amount of money the thief can rob without alerting the police.

Example 1:

在这里插入图片描述
Input: root = [3,2,3,null,3,null,1]
Output: 7
Explanation: Maximum amount of money the thief can rob = 3 + 3 + 1 = 7.

Example 2:

在这里插入图片描述

Input: root = [3,4,5,1,3,null,1]
Output: 9
Explanation: Maximum amount of money the thief can rob = 4 + 5 = 9.

Constraints:

The number of nodes in the tree is in the range [1, 10^4].
0 <= Node.val <= 10^4

代码

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int rob(TreeNode* root) {
        if(root == NULL)
			return 0;

		vector<int> res = dfs(root);
		return max(res[0], res[1]);
    }
    
    vector<int> dfs(TreeNode *root){
        if(root == NULL)
            return vector<int>(2,0);
        vector<int> left = dfs(root->left);
        vector<int> right = dfs(root->right);
        vector<int> res = vector<int>(2,0);
        res[0] = max(left[0], left[1]) + max(right[0], right[1]);
        res[1] = left[0] + right[0] + root->val;
        return res;
    }
};