给定一系列城市的编号和它们之间的距离，本题要求找到连接所有城市使其连通的最小总成本。这是一道最小生成树问题，可以使用Kruskal或Prim算法解决。Kruskal算法先对距离排序，然后逐步连接点；Prim算法从一个节点开始，每次选择最短距离的节点，直至所有节点连接。文中提供了使用UnionFind的Kruskal算法实现，具有较低的时间复杂度。
题目：
There are N cities numbered from 1 to N.
You are given connections, where each connections[i] = [city1, city2, cost] represents the cost to connect city1 and city2 together. (A connection is bidirectional: connecting city1 and city2 is the same as connecting city2 and city1.)
Return the minimum cost so that for every pair of cities, there exists a path of connections (possibly of length 1) that connects those two cities together. The cost is the sum of the connection costs used. If the task is impossible, return -1.
Example 1:
Input: N = 3, connections = [[1,2,5],[1,3,6],[2,3,1]] Output: 6 Exp
最低0.47元/天 解锁文章
1401
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
