《每日一题——337. 打家劫舍 III》

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
//dp[i][0]表示不偷,dp[i][1]表示偷
    using PII = pair<int, int> ;
    PII dfs(TreeNode* tree){
        if (tree == nullptr){
            return {0, 0};
        }
        PII left = dfs(tree->left);
        PII right = dfs(tree->right);
        int first = max(left.second,left.first) + max(right.first, right.second);
        int second = tree->val + left.first + right. first;

        return {first, second};
    }
    int rob(TreeNode* root) {
        PII res = dfs(root);

        return max(res.first, res.second);
    }
};