Leetcode 337. House Robber III（递归）

Leetcode 337. House Robber III

题目链接： House Robber III

难度：Medium

题目大意：

详见题目。

思路：

参考官方题解，对是否偷窃当前节点分情况讨论。

代码

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    public int rob(TreeNode root) {
        int[] res=helper(root);
        return Math.max(res[0],res[1]);
    }
    public int[] helper(TreeNode root){
        if(root==null){
            return new int[]{0,0};
        }
        int[] left=helper(root.left);
        int[] right=helper(root.right);
        int rob=root.val+left[1]+right[1];
        int notRob=Math.max(left[0],left[1])+Math.max(right[0],right[1]);
        return new int[]{rob,notRob};
    }
}