Example 1:
Input: gNodes = 4, gFrom = [1, 2, 3], gTo = [4, 4, 4]
Output: 2
Explanation:
Example 2:
Input: gNodes = 4, gFrom = [1, 1, 3], gTo = [2, 3, 4]
Output: 0
Explanation:
Example 3:
Input: gNodes = 4, gFrom = [2, 2, 4], gTo = [1, 3, 3]
Output: 1
Explanation:
You are given a directed graph with gNodes nodes numbered from 1 to gNodes and gNodes - 1 directed edges. The ith edge goes from gFrom[i] to gTo[i].
The underlying undirected graph is guaranteed to form a tree.
Choose any node as the root. You may reverse directed edges so that after all reversals, every edge points away from the chosen root.
Return the minimum number of edge reversals needed over all possible root choices.
Choosing node 2 as the root works best. Reverse edges 1 -> 4 and 3 -> 4 so every edge points away from node 2.
If node 1 is the root, every edge already points away from it, so no reversal is needed.
Choosing node 2 as the root only requires reversing edge 4 -> 3 to 3 -> 4.
1 <= gNodes <= 10^5gFrom.length == gTo.length == gNodes - 11 <= gFrom[i], gTo[i] <= gNodesgFrom[i] != gTo[i]