Python | Leetcode Python题解之第547题省份数量
题目：
题解：
class Solution:
def findCircleNum(self, isConnected: List[List[int]]) -> int:
def find(index: int) -> int:
if parent[index] != index:
parent[index] = find(parent[index])
return parent[index]
def union(index1: int, index2: int):
parent[find(index1)] = find(index2)
cities = len(isConnected)
parent = list(range(cities))
for i in range(cities):
for j in range(i + 1, cities):
if isConnected[i][j] == 1:
union(i, j)
provinces = sum(parent[i] == i for i in range(cities))
return provinces原文地址：https://blog.csdn.net/Mopes__/article/details/143611820
免责声明：本站文章内容转载自网络资源，如本站内容侵犯了原著者的合法权益，可联系本站删除。更多内容请关注自学内容网（zxcms.com）！