LeetCode每日一题(2316. Count Unreachable Pairs of Nodes in an Undirected Graph)

You are given an integer n. There is an undirected graph with n nodes, numbered from 0 to n - 1. You are given a 2D integer array edges where edges[i] = [ai, bi] denotes that there exists an undirected edge connecting nodes ai and bi.

Return the number of pairs of different nodes that are unreachable from each other.

Example 1:

Input: n = 3, edges = [[0,1],[0,2],[1,2]]
Output: 0

Explanation: There are no pairs of nodes that are unreachable from each other. Therefore, we return 0.

Example 2:

Input: n = 7, edges = [[0,2],[0,5],[2,4],[1,6],[5,4]]
Output: 14

Explanation: There are 14 pairs of nodes that are unreachable from each other:
[[0,1],[0,3],[0,6],[1,2],[1,3],[1,4],[1,5],[2,3],[2,6],[3,4],[3,5],[3,6],[4,6],[5,6]].
Therefore, we return 14.

Constraints:

• 1 <= n <= 105
• 0 <= edges.length <= 2 * 105
• edges[i].length == 2
• 0 <= ai, bi < n
• ai != bi
• There are no repeated edges.

---

用 union-find 的方法来把每一个孤立的图变成一棵树， 然后我们可以得到每棵树里面的节点数量， 假设 nodes[i]是当前树的节点数量， 那 n - nodes[i]就是所有与当前树里的节点不相连的节点数量， nodes[i] * (n - nodes[i])就是 pair 的数量， 遍历所有的数计算出 pair 数量进行加和就是最终答案

---

use std::collections::HashMap;

impl Solution {
   
    fn find(parent: &mut Vec<i32>, n: i32) -> i32 {