-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.cs
More file actions
59 lines (55 loc) · 1.62 KB
/
Solution.cs
File metadata and controls
59 lines (55 loc) · 1.62 KB
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
public class Solution
{
public TreeNode ReplaceValueInTree(TreeNode root)
{
if (root is null) return null;
Queue<TreeNode> queue = [];
Dictionary<int, int> dp = [];
queue.Enqueue(root);
int level = 0;
while (queue.Count > 0)
{
int length = queue.Count;
level++;
for (int i = 0; i < length; i++)
{
var node = queue.Dequeue();
dp[level] = dp.GetValueOrDefault(level, 0) + node.val;
if (node.left is not null) queue.Enqueue(node.left);
if (node.right is not null) queue.Enqueue(node.right);
}
}
queue.Enqueue(root);
root.val = 0;
level = 0;
while (queue.Count > 0)
{
int length = queue.Count;
level++;
for (int i = 0; i < length; i++)
{
var node = queue.Dequeue();
int sum = 0;
if (node.left is not null)
{
queue.Enqueue(node.left);
sum += node.left.val;
}
if (node.right is not null)
{
queue.Enqueue(node.right);
sum += node.right.val;
}
if (node.left is not null)
{
node.left.val = dp[level + 1] - sum;
}
if (node.right is not null)
{
node.right.val = dp[level + 1] - sum;
}
}
}
return root;
}
}