Leetcode 547 解析: Number of Provinces (Python)

最新推荐文章于 2021-10-28 09:25:53 发布

「已注销」

最新推荐文章于 2021-10-28 09:25:53 发布

阅读量501

点赞数 1

分类专栏： Leetcode 文章标签： leetcode 算法 python dfs

本文链接：https://blog.csdn.net/TmrTT/article/details/113574561

版权

该博客讨论了LeetCode的547题，即找出所有省份的数量。题目涉及城市间直接或间接的连接关系，一个省份是所有可以直接或间接连接的城市的集合。博主提出了使用深度优先搜索（DFS）的方法来解决，通过建立visited集合，遍历并递归地查找所有连通的城市，每找到一个连通的城市链，计数器加一。文章包含了详细的DFS实现代码和问题解析。

摘要由CSDN通过智能技术生成

文章目录

题目描述

There are n cities. Some of them are connected, while some are not. If city a is connected directly with city b, and city b is connected directly with city c, then city a is connected indirectly with city c.

A province is a group of directly or indirectly connected cities and no other cities outside of the group.

You are given an n x n matrix isConnected where isConnected[i][j] = 1 if the ith city and the jth city are directly connected, and isConnected[i][j] = 0 otherwise.

Return the total number of provinces.

LC#547
Constraints:

1 <= n <= 200
n == isConnected.length
n == isConnected[i].length
isConnected[i][j] is 1 or 0.
isConnected[i][i] == 1
isConnected[i][j] == isConnected[j][i]