547. Number of Provinces

Medium

8.3K

311

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 `i`

city and the ^{th}`j`

city are directly connected, and ^{th}`isConnected[i][j] = 0`

otherwise.

Return *the total number of provinces*.

**Example 1:**

Input:isConnected = [[1,1,0],[1,1,0],[0,0,1]]Output:2

**Example 2:**

Input:isConnected = [[1,0,0],[0,1,0],[0,0,1]]Output:3

**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]`

Accepted

683.5K

Submissions

1.1M

Acceptance Rate

65.0%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved