这篇博客介绍了如何利用并查集算法解决LeetCode 1319题，讨论了如何确定多余网线并计算最小连接次数，以确保所有计算机在最少操作下形成一个连通网络。如果多余网线数量少于集合数量减一，则无法实现全部连接。
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]]
最低0.47元/天 解锁文章
扫一扫
390
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
