题目描述:给你一个points 数组,表示 2D 平面上的一些点,其中 points[i] = [xi, yi] 。
连接点 [xi, yi] 和点 [xj, yj] 的费用为它们之间的 曼哈顿距离 :|xi - xj| + |yi - yj| ,其中 |val| 表示 val 的绝对值。
请你返回将所有点连接的最小总费用。只有任意两点之间 有且仅有 一条简单路径时,才认为所有点都已连接
解法一:每次都加入和已构成联通区域中的点的最短距离对应的连接的那个点
class Solution:
def minCostConnectPoints(self, points: List[List[int]]) -> int:
n = len(points)
dist = [[0]*n for _ in range(n)]
for i in range(n):
for j in range(i+1, n):
dist[i][j] = dist[j][i] = abs(points[i][0] - points[j][0]) + abs(points[i][1] - points[j][1])
visited = [False] * n
cur = 0
origin = set(list(range(n)))
cur = set([0])
res = 0
for i in range(n-1):
idx = 0
dis = float('inf')
for rest in (origin-cur):
for c in cur:
if dist[c][rest] < dis:
idx = rest
dis = dist[c][rest]
cur.add(idx)
res += dis
return res
解题思路二:Kruskal算法,最小生成树,对图中所有的边进行排序,一次加入最短的并且不会构成环路的点,即对应的边连接的两个顶点不在同一个连通域中,可以用并查集来判断每条边是否是是连接两个不同连通域的点,代码如下:
class UnionFind(object):
def __init__(self, n):
self.rank = [1] * n
self.father = list(range(n))
def find(self, i):
root = i
while(root != self.father[root]):
root = self.father[root]
while(i != root):
origin_r = self.father[i]
self.father[i] = root
i = origin_r
return root
def union(self, a, b):
root_a, root_b = self.find(a), self.find(b)
if root_a == root_b:
return False
else:
if self.rank[root_a] < self.rank[root_b]:
root_a, root_b = root_b, root_a
self.rank[root_a] += self.rank[root_b]
self.father[root_b] = root_a
return True
class Solution:
def minCostConnectPoints(self, points: List[List[int]]) -> int:
n = len(points)
edge = []
for i in range(n):
for j in range(i+1, n):
dist = abs(points[i][0] - points[j][0]) + abs(points[i][1] - points[j][1])
edge.append((dist, i, j))
edge.sort()
res = 0
num = 0
uf = UnionFind(n)
for dist, x, y in edge:
if uf.union(x, y):
res += dist
num += 1
if num == n:
break
return res