-
Notifications
You must be signed in to change notification settings - Fork 1
/
Divisibility_Tree.cpp
43 lines (38 loc) · 1.09 KB
/
Divisibility_Tree.cpp
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
class Solution
{
public:
int dfshelper(int src, vector<vector<int>> &adj, bool *visited, int &ans)
{
int count = 1;
visited[src] = true;
for (auto nbr : adj[src])
{
if (!visited[nbr])
{
int subtree_count = dfshelper(nbr, adj, visited, ans);
if (subtree_count % 2 == 0)
{
ans++;
}
else
{
count += subtree_count;
}
}
}
return count;
}
int minimumEdgeRemove(int n, vector<vector<int>> &edges)
{
vector<vector<int>> adj(n);
bool *visited = new bool[n]{false};
for (const auto &edge : edges)
{
adj[edge[0] - 1].push_back(edge[1] - 1);
adj[edge[1] - 1].push_back(edge[0] - 1);
}
int ans = 0;
dfshelper(0, adj, visited, ans);
return ans;
}
};