1319. Number of Operations to Make Network Connected

https://leetcode.com/problems/number-of-operations-to-make-network-connected/

There are n computers numbered from 0 to n-1 connected by ethernet cables connections forming a network where connections[i] = [a, b] represents a connection between computers a and b. Any computer can reach any other computer directly or indirectly through the network.

Given an initial computer network connections. You can extract certain cables between two directly connected computers, and place them between any pair of disconnected computers to make them directly connected. Return the minimum number of times you need to do this in order to make all the computers connected. If it's not possible, return -1. 

Example 1:

Input: n = 4, connections = [[0,1],[0,2],[1,2]]
Output: 1
Explanation: Remove cable between computer 1 and 2 and place between computers 1 and 3.

Example 2:

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

Example 3:

Input: n = 6, connections = [[0,1],[0,2],[0,3],[1,2]]
Output: -1
Explanation: There are not enough cables.

Example 4:

Input: n = 5, connections = [[0,1],[0,2],[3,4],[2,3]]
Output: 0

Constraints:

• 1 <= n <= 10^5
• 1 <= connections.length <= min(n*(n-1)/2, 10^5)
• connections[i].length == 2
• 0 <= connections[i][0], connections[i][1] < n
• connections[i][0] != connections[i][1]
• There are no repeated connections.
• No two computers are connected by more than one cable.

---

算法思路：

union-find

class Solution {
public:
    int makeConnected(int n, vector<vector<int>>& connections) {
        if (n - 1 > connections.size()) return -1; // 边数一定不够的case
        vector<int> s(n, -1);
        int count = 0; // 统计正确union的边的个数
        for (auto v : connections) {
            int a = v[0];
            int b = v[1];  
            if (myUnion(s, a, b)) count++;
            if (count == n - 1) return 0; // 已经完成连接，但是还有很多冗余连接边，可以直接返回
        }
        return n - 1 - count; // n台电脑，n - 1条边连接
    }   
private:
    bool myUnion(vector<int>& s, const int& a, const int& b) {
        int root1 = myFind(s, a);
        int root2 = myFind(s, b);
        if (root1 == root2) return false;
        if (s[root1] < s[root2]) {
            s[root1] += s[root2];
            s[root2] = root1;
        } else {
            s[root2] += s[root1];
            s[root1] = root2;
        }
        return true;
    }
    
    int myFind(vector<int>& s, const int& x) {
        if (s[x] < 0) {
            return x;
        } else {
            return s[x] = myFind(s, s[x]);
        }
    }
};