-
Notifications
You must be signed in to change notification settings - Fork 7
/
Main.java
62 lines (55 loc) · 1.67 KB
/
Main.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
package com.company;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Map;
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;
}
}
public class Main {
public static void main(String[] args) {
// write your code here
}
public int deepestLeavesSum_bfs(TreeNode root) {
ArrayDeque<TreeNode> queue = new ArrayDeque<>(){{offer(root);}};
ArrayList<Integer> leavesSum = new ArrayList<>();
while (!queue.isEmpty()){
int count = queue.size();
int sum = 0;
for (int i = 0; i < count; i++) {
TreeNode cur = queue.poll();
if(cur.left == cur.right) sum += cur.val;
if(cur.left != null) queue.offer(cur.left);
if(cur.right != null) queue.offer(cur.right);
}
leavesSum.add(sum);
}
return leavesSum.get(leavesSum.size() - 1);
}
int deepest = 0;
Map<Integer, Integer> map;
public int deepestLeavesSum_dfs(TreeNode root) {
map = new HashMap<>();
dfs(root, 0);
return map.get(deepest);
}
public void dfs(TreeNode node, int depth){
if(node == null) return;
if(node.left == node.right)
{
map.put(depth, map.getOrDefault(depth, 0) + node.val);
deepest = Math.max(deepest, depth);
}
dfs(node.left, depth + 1);
dfs(node.right, depth + 1);
}
}