leetcode/prob337.java at master · dilemmawalker/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
/**
 * 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 c=0;
        if(root==null)
        return 0;
        else if(root.left==null && root.right==null)
        return root.val;

        int roo=sol(root,0);
        int l=sol(root.left,0);
        int r=sol(root.right,0);

        int lkaleft=0,lkaright=0,rkaleft=0,rkaright=0;
        if(root.left!=null && root.left.left!=null)
        lkaleft=sol(root.left.left,0);
        if(root.left!=null && root.left.right!=null)
        lkaright=sol(root.left.right,0);
        if(root.right!=null && root.right.left!=null)
        rkaleft=sol(root.right.left,0);
        if(root.right!=null && root.right.right!=null)
        rkaright=sol(root.right.right,0);

        int ans=Math.max(roo,l+r);
        ans=Math.max(ans,Math.max(l+rkaleft,l+rkaright));
        ans=Math.max(ans,Math.max(r+lkaleft,r+lkaright));
        return ans;
    }
    int anss=0;
    public int sol(TreeNode root, int c){
        if(root==null){
            anss=Math.max(anss,c);
        return c;
        }
        else if(root.left==null && root.right==null){
            anss=Math.max(anss,c+root.val);
        return c+root.val;
        }
        int res=0,res2=0;

        //left
        if(root.left==null)
        res=c+root.val;
        else{
        res=Math.max(res,sol(root.left.left,c+root.val));
        res=Math.max(res,sol(root.left.right,c+root.val));

        if(root.left.left==null)
        res=Math.max(c+root.val,res);
        else{
        res=Math.max(res,sol(root.left.left.left,c+root.val));
        res=Math.max(res,sol(root.left.left.right,c+root.val));
        }

        if(root.left.right==null)
        res=Math.max(c+root.val,res);
        else{
        res=Math.max(res,sol(root.left.right.left,c+root.val));
        res=Math.max(res,sol(root.left.right.right,c+root.val));
        }
        }

       //right
        if(root.right==null)
        res2=Math.max(c+root.val,res2);
        else{
        res2=Math.max(res2,sol(root.right.left,c+root.val));
        res2=Math.max(res2,sol(root.right.right,c+root.val));

        if(root.right.left==null)
        res2=Math.max(c+root.val,res2);
        else{
        res2=Math.max(res2,sol(root.right.left.left,c+root.val));
        res2=Math.max(res2,sol(root.right.left.right,c+root.val));
        }

        if(root.right.right==null)
        res2=Math.max(c+root.val,res2);
        else{
        res2=Math.max(res2,sol(root.right.right.left,c+root.val));
        res2=Math.max(res2,sol(root.right.right.right,c+root.val));
        }
        }

        return res+res2-root.val;
    }
}