337. House Robber III

最新推荐文章于 2024-09-27 15:30:00 发布

qq_34229391

最新推荐文章于 2024-09-27 15:30:00 发布

阅读量172

点赞数

分类专栏： LeetCode 文章标签： leetcode dynamic programming dfs

本文链接：https://blog.csdn.net/qq_34229391/article/details/82591002

版权

LeetCode 专栏收录该内容

23 篇文章 0 订阅

订阅专栏

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.

Example 1:

Input: [3,2,3,null,3,null,1]

     3
    / \
   2   3
    \   \ 
     3   1

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

Example 2:

Input: [3,4,5,1,3,null,1]

     3
    / \
   4   5
  / \   \ 
 1   3   1

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

给出一棵树，这棵树上的每一个结点都具有自己的值，现在要从中取结点，结点个树不限，但是取得任何两个结点不能是相邻的，求取得的这些点的值的和的最大值max。
采用动态规划和dfs解决这个问题。

对于一个结点node来说，求的它的左子树中的left_max，将left_max分成两种状况，将左子树的根结点包括在内的with_root_left_max，和不包括左子树根结点的no_root_left_max，再求出with_root_right_max和no_root_right_max，那么此时以node作为根结点的树的with_root_max = no_root_left_max + no_root_right_max + node->val, no_root_max = max(with_root_left_max, no_root_left_max) + max(with_root_right_max, no_root_right_max).

于是下面的代码就产生了。

struct TreeNode
{
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};
pair<int, int> robhelper(TreeNode* node)
{
    if(!node->left && !node->right)return {node->val, 0};
    int with_root = node->val, no_root = 0;
    if(node->left)
    {
        pair<int, int> left = robhelper(node->left);
        with_root += left.second;
        no_root += max(left.first, left.second);
    }
    if(node->right)
    {
        pair<int, int> right = robhelper(node->right);
        with_root += right.second;
        no_root += max(right.first, right.second);
    }
    return {with_root, no_root};
}
int rob(TreeNode* root)
{
    if(!root)return 0;
    pair<int, int> result = robhelper(root);
    return result.first > result.second ? result.first : result.second;
}