-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
337.java
63 lines (61 loc) · 1.93 KB
/
337.java
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
__________________________________________________________________________________________________
sample 35692 kb submission
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
Map<TreeNode,Integer> map = new HashMap<>();
public int rob(TreeNode root) {
if(map.containsKey(root))
return map.get(root);
if(root==null)
return 0;
if(root.left==null&&root.right==null)
return root.val;
int sum1 = rob(root.left)+rob(root.right);
int sum2=root.val;
if(root.left!=null&&root.left.left!=null)
sum2+= rob(root.left.left);
if(root.left!=null&&root.left.right!=null)
sum2+= rob(root.left.right);
if(root.right!=null&&root.right.left!=null)
sum2+= rob(root.right.left);
if(root.right!=null&&root.right.right!=null)
sum2+= rob(root.right.right);
int ans = Math.max(sum1,sum2);
map.put(root,ans);
return ans;
}
}
__________________________________________________________________________________________________
sample 0 ms submission
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public int rob(TreeNode root) {
int[] a = maxVal(root);
return Math.max(a[0],a[1]);
}
private int[] maxVal(TreeNode node) {
if (node == null) {
return new int[2];
}
int[] left = maxVal(node.left);
int[] right = maxVal(node.right);
return new int[]{Math.max(left[1] + right[1] + node.val, left[0] + right[0]), left[0] + right[0]};
}
}
__________________________________________________________________________________________________