Package g0501_0600.s0547_number_of_provinces

Class Solution

java.lang.Object
g0501_0600.s0547_number_of_provinces.Solution
public class Solution extends Object
547 - Number of Provinces.<p>Medium</p> <p>There are <code>n</code> cities. Some of them are connected, while some are not. If city <code>a</code> is connected directly with city <code>b</code>, and city <code>b</code> is connected directly with city <code>c</code>, then city <code>a</code> is connected indirectly with city <code>c</code>.</p> <p>A <strong>province</strong> is a group of directly or indirectly connected cities and no other cities outside of the group.</p> <p>You are given an <code>n x n</code> matrix <code>isConnected</code> where <code>isConnected[i][j] = 1</code> if the <code>i<sup>th</sup></code> city and the <code>j<sup>th</sup></code> city are directly connected, and <code>isConnected[i][j] = 0</code> otherwise.</p> <p>Return <em>the total number of <strong>provinces</strong></em>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2020/12/24/graph1.jpg" alt="" /></p> <p><strong>Input:</strong> isConnected = [[1,1,0],[1,1,0],[0,0,1]]</p> <p><strong>Output:</strong> 2</p> <p><strong>Example 2:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2020/12/24/graph2.jpg" alt="" /></p> <p><strong>Input:</strong> isConnected = [[1,0,0],[0,1,0],[0,0,1]]</p> <p><strong>Output:</strong> 3</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= n <= 200</code></li> <li><code>n == isConnected.length</code></li> <li><code>n == isConnected[i].length</code></li> <li><code>isConnected[i][j]</code> is <code>1</code> or <code>0</code>.</li> <li><code>isConnected[i][i] == 1</code></li> <li><code>isConnected[i][j] == isConnected[j][i]</code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • findCircleNum

      public int findCircleNum(int[][] arr)