House Robber III 问题及解法

最新推荐文章于 2022-06-20 14:42:10 发布

我们要爱学习

最新推荐文章于 2022-06-20 14:42:10 发布

阅读量335

点赞数

分类专栏： LeetCode算法练习（Medium）文章标签： LeetCode Medium

本文链接：https://blog.csdn.net/u011809767/article/details/77977310

版权

LeetCode算法练习（Medium）专栏收录该内容

238 篇文章 1 订阅

订阅专栏

问题描述：

The thief has found himself a new place for his thievery again. There is only one entrance to this area, called the "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 forms a binary tree". It will automatically contact the police if two directly-linked houses were broken into on the same night.

Determine the maximum amount of money the thief can rob tonight without alerting the police.

示例:

Maximum amount of money the thief can rob = 3 + 3 + 1 = 7 .

Maximum amount of money the thief can rob = 4 + 5 = 9 .

问题分析：

对于一个节点，我们可以选择抢或者不抢，我们每次把抢该节点的最大值和不抢该节点的最大值保存下来，最终比较大小即可。

过程详见代码：

/**
 * 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)
	{
		pair<int, int> res = dfs(root);
		return max(res.first, res.second);
	}

private:
	pair<int, int> dfs(TreeNode* root)
	{
		if (root == nullptr) return pair<int, int>(0, 0);
		pair<int, int> res1 = dfs(root->left);
		pair<int, int> res2 = dfs(root->right);
		pair<int, int> res;
		res.first = root->val + res1.second + res2.second;
		res.second = max(res1.first, res1.second) + max(res2.first, res2.second);
		return res;
	}
};