-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
1022.java
59 lines (54 loc) · 1.58 KB
/
1022.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
__________________________________________________________________________________________________
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 sumRootToLeaf(TreeNode root) {
return dfs(root, 0);
}
private int dfs(TreeNode root, int val) {
if (root == null) return 0;
int curr = val * 2 + root.val;
int l = dfs(root.left, curr);
int r = dfs(root.right, curr);
if (root.left == null && root.right == null)
l = curr;
return l + r;
}
}
__________________________________________________________________________________________________
sample 36732 kb submission
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
int sum = 0;
public int sumRootToLeaf(TreeNode root) {
sumRootToLeaf(root, "");
return sum;
}
public void sumRootToLeaf(TreeNode root, String s) {
if (root==null) return;
if (root.right==null&&root.left==null) {
int x = Integer.parseInt(s+root.val, 2);
sum+=x;
return;
}
sumRootToLeaf(root.left, s+root.val);
sumRootToLeaf(root.right, s+root.val);
}
}
__________________________________________________________________________________________________