-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.cs
More file actions
40 lines (34 loc) · 1.1 KB
/
Solution.cs
File metadata and controls
40 lines (34 loc) · 1.1 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
public class Solution
{
public int[] TreeQueries(TreeNode root, int[] queries)
{
int[] levelArr = new int[100_001];
int[] depth = new int[100_001];
int[] max1 = new int[100_001];
int[] max2 = new int[100_001];
int DFS(TreeNode root, int level)
{
if (root is null) return 0;
levelArr[root.val] = level;
depth[root.val] = 1 + Math.Max(DFS(root.right, level + 1), DFS(root.left, level + 1));
if (max1[level] < depth[root.val])
{
max2[level] = max1[level];
max1[level] = depth[root.val];
}
else if (max2[level] < depth[root.val])
{
max2[level] = depth[root.val];
}
return depth[root.val];
}
DFS(root, 0);
int[] ans = new int[queries.Length];
for (int i = 0; i < ans.Length; i++)
{
int level = levelArr[queries[i]];
ans[i] = (max1[level] == depth[queries[i]] ? max2[level] : max1[level]) + level - 1;
}
return ans;
}
}