Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
friend circle problem
Language:
Ada
Assembly
Bash
C#
C++ (gcc)
C++ (clang)
C++ (vc++)
C (gcc)
C (clang)
C (vc)
Client Side
Clojure
Common Lisp
D
Elixir
Erlang
F#
Fortran
Go
Haskell
Java
Javascript
Kotlin
Lua
MySql
Node.js
Ocaml
Octave
Objective-C
Oracle
Pascal
Perl
Php
PostgreSQL
Prolog
Python
Python 3
R
Rust
Ruby
Scala
Scheme
Sql Server
Swift
Tcl
Visual Basic
Layout:
Vertical
Horizontal
//'main' method must be in a class 'Rextester'. //Compiler version 1.8.0_111 import java.util.*; import java.lang.*; class Rextester { public int findCircleNum(int[][] M) { int[] visited = new int[M.length]; int count = 0; for (int i = 0; i < M.length; i++) { if (visited[i] == 0) { dfs(M, visited, i); count++; } } return count; } public void dfs(int[][] M, int[] visited, int i) { for (int j = 0; j < M.length; j++) { if (M[i][j] == 1 && visited[j] == 0) { visited[j] = 1; dfs(M, visited, j); } } } public static void main(String args[]) { System.out.println("Hello, World!"); } }
[
+
]
Show input
Compilation time: 1.04 sec, absolute running time: 0.18 sec, cpu time: 0.19 sec, memory peak: 18 Mb, absolute service time: 1,23 sec
edit mode
|
history
|
discussion
Hello, World!