Class Solution
java.lang.Object
g2501_2600.s2581_count_number_of_possible_root_nodes.Solution
2581 - Count Number of Possible Root Nodes.<p>Hard</p>
<p>Alice has an undirected tree with <code>n</code> nodes labeled from <code>0</code> to <code>n - 1</code>. The tree is represented as a 2D integer array <code>edges</code> of length <code>n - 1</code> where <code>edges[i] = [a<sub>i</sub>, b<sub>i</sub>]</code> indicates that there is an edge between nodes <code>a<sub>i</sub></code> and <code>b<sub>i</sub></code> in the tree.</p>
<p>Alice wants Bob to find the root of the tree. She allows Bob to make several <strong>guesses</strong> about her tree. In one guess, he does the following:</p>
<ul>
<li>Chooses two <strong>distinct</strong> integers <code>u</code> and <code>v</code> such that there exists an edge <code>[u, v]</code> in the tree.</li>
<li>He tells Alice that <code>u</code> is the <strong>parent</strong> of <code>v</code> in the tree.</li>
</ul>
<p>Bob’s guesses are represented by a 2D integer array <code>guesses</code> where <code>guesses[j] = [u<sub>j</sub>, v<sub>j</sub>]</code> indicates Bob guessed <code>u<sub>j</sub></code> to be the parent of <code>v<sub>j</sub></code>.</p>
<p>Alice being lazy, does not reply to each of Bob’s guesses, but just says that <strong>at least</strong> <code>k</code> of his guesses are <code>true</code>.</p>
<p>Given the 2D integer arrays <code>edges</code>, <code>guesses</code> and the integer <code>k</code>, return <em>the <strong>number of possible nodes</strong> that can be the root of Alice’s tree</em>. If there is no such tree, return <code>0</code>.</p>
<p><strong>Example 1:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2022/12/19/ex-1.png" alt="" /></p>
<p><strong>Input:</strong> edges = [[0,1],[1,2],[1,3],[4,2]], guesses = [[1,3],[0,1],[1,0],[2,4]], k = 3</p>
<p><strong>Output:</strong> 3</p>
<p><strong>Explanation:</strong></p>
<p>Root = 0, correct guesses = [1,3], [0,1], [2,4]</p>
<p>Root = 1, correct guesses = [1,3], [1,0], [2,4]</p>
<p>Root = 2, correct guesses = [1,3], [1,0], [2,4]</p>
<p>Root = 3, correct guesses = [1,0], [2,4]</p>
<p>Root = 4, correct guesses = [1,3], [1,0]</p>
<p>Considering 0, 1, or 2 as root node leads to 3 correct guesses.</p>
<p><strong>Example 2:</strong></p>
<p><img src="https://assets.leetcode.com/uploads/2022/12/19/ex-2.png" alt="" /></p>
<p><strong>Input:</strong> edges = [[0,1],[1,2],[2,3],[3,4]], guesses = [[1,0],[3,4],[2,1],[3,2]], k = 1</p>
<p><strong>Output:</strong> 5</p>
<p><strong>Explanation:</strong></p>
<p>Root = 0, correct guesses = [3,4]</p>
<p>Root = 1, correct guesses = [1,0], [3,4]</p>
<p>Root = 2, correct guesses = [1,0], [2,1], [3,4]</p>
<p>Root = 3, correct guesses = [1,0], [2,1], [3,2], [3,4]</p>
<p>Root = 4, correct guesses = [1,0], [2,1], [3,2]</p>
<p>Considering any node as root will give at least 1 correct guess.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>edges.length == n - 1</code></li>
<li><code>2 <= n <= 10<sup>5</sup></code></li>
<li><code>1 <= guesses.length <= 10<sup>5</sup></code></li>
<li><code>0 <= a<sub>i</sub>, b<sub>i</sub>, u<sub>j</sub>, v<sub>j</sub> <= n - 1</code></li>
<li><code>a<sub>i</sub> != b<sub>i</sub></code></li>
<li><code>u<sub>j</sub> != v<sub>j</sub></code></li>
<li><code>edges</code> represents a valid tree.</li>
<li><code>guesses[j]</code> is an edge of the tree.</li>
<li><code>guesses</code> is unique.</li>
<li><code>0 <= k <= guesses.length</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
rootCount
public int rootCount(int[][] eg, int[][] gu, int k)
-