leetcode 337. 打家劫舍 III

https://leetcode-cn.com/problems/house-robber-iii/

暴力递归（最后一个用例超时）

class Solution {
public:
    int rob(TreeNode* root) {
        return max(rob(root,1), rob(root,0));
    }
    
    int rob(TreeNode* root, bool pick_root)
    {
        if (root==NULL) return 0;
        
        if (pick_root)
        {
            return root->val + rob(root->left,0) + rob(root->right,0);
        }
        else
        {
            return max(rob(root->left,1),rob(root->left,0)) + max(rob(root->right,1),rob(root->right,0));
        }
    }
};

记忆化递归

    map<pair<TreeNode*,int>, int> memo;
    
    int rob(TreeNode* root) {
        return max(rob(root,1), rob(root,0));
    }
    
    int rob(TreeNode* root, int pick_root)
    {
        if (root==NULL) return 0;
        auto it = memo.find(make_pair(root,pick_root));
        if (it != memo.end())
            return it->second;
        
        int res;
        if (pick_root)
        {
            res = root->val + rob(root->left,0) + rob(root->right,0);
        }
        else
        {
            res = max(rob(root->left,1),rob(root->left,0)) + max(rob(root->right,1),rob(root->right,0));         
        }
        
        memo[make_pair(root,pick_root)] = res;
        return res;           
    }

DP（其实感觉也不算DP）

    int rob(TreeNode* root)
    {
        if (root == nullptr)return 0;
        vector<int > ans;
        ans = robDp(root);
        return max(ans[0], ans[1]);
    }
    
    vector<int > robDp(TreeNode* root)
    {
        //返回数组第一位为包含根节点最大值，第二位为不包含根节点最大值
        if (root == 0)return{ 0, 0 };
        vector<int > left = robDp(root->left);//左子树的信息
        vector<int > right = robDp(root->right);//右子树的信息
        vector<int > temp(2, 0);
        temp[0] = root->val + left[1]+right[1];//包含根节点的最大值
        temp[1] = max(max(left[0] + right[0], left[1] + right[1]),max(left[0]+right[1],left[1]+right[0]));//不包含根节点的最大值
        return temp;
    }