Solved! Leetcode 1319. Number of Operations to Make Network Connected

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

Number of Operations to Make Network Connected

Description

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

You are 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 is 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.

Constraints:

1 <= n <= 105
1 <= connections.length <= min(n * (n – 1) / 2, 105)
connections[i].length == 2
0 <= ai, bi < n
ai != bi
There are no repeated connections.
No two computers are connected by more than one cable.

Solution

class Solution {
    public int makeConnected(int n, int[][] connections) {
        //
        int totalConnections = n-1;
        if(connections.length < totalConnections)
            return -1;

        int[] parent = new int[n];
        for(int i=0;i<n;i++){
            parent[i] = i;
        }

        for(int[] connection: connections){
            int min = Math.min(connection[0], connection[1]);
            int max = Math.max(connection[0], connection[1]);
            union(parent, max, min);
        }

        HashSet<Integer> set = new HashSet<>();
        for(int i=0;i<parent.length;i++){
            set.add(find(parent, parent[i]));
        }

        return set.size()-1;
    }

    private int find(int[] parent, int x){
        int n = x;
        while(n!=parent[n]){
            n = parent[n];
        }
        parent[x] = n;
        return n;
    }

    private void union(int[] parent, int x, int y){
        int parentX = find(parent, x);
        int parentY = find(parent, y);
        if(parent[parentX]!=parent[parentY]){
            parent[parentX] = parentY;
        }
    }
}

class Solution {

public int makeConnected(int n, int[][] connections) {

int totalConnections = n-1;

if(connections.length < totalConnections)

return -1;

int[] parent = new int[n];

for(int i=0;i<n;i++){

parent[i] = i;

}

for(int[] connection: connections){

int min = Math.min(connection[0], connection[1]);

int max = Math.max(connection[0], connection[1]);

union(parent, max, min);

}

HashSet<Integer> set = new HashSet<>();

for(int i=0;i<parent.length;i++){

set.add(find(parent, parent[i]));

}

return set.size()-1;

}

private int find(int[] parent, int x){

int n = x;

while(n!=parent[n]){

n = parent[n];

}

parent[x] = n;

return n;

}

private void union(int[] parent, int x, int y){

int parentX = find(parent, x);

int parentY = find(parent, y);

if(parent[parentX]!=parent[parentY]){

parent[parentX] = parentY;

}

Rate this post

Coddicted