From c3dbd234e7f84fe8843a98be942a7d7d492f2547 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E5=B7=A6=E7=A8=8B=E4=BA=91?= <algorithmzuo@163.com>
Date: Tue, 22 Dec 2020 19:43:13 +0800
Subject: [PATCH] modify code

---
 src/class09_15/Code01_FriendCircles.java | 25 ++++++++++++------------
 1 file changed, 13 insertions(+), 12 deletions(-)

diff --git a/src/class09_15/Code01_FriendCircles.java b/src/class09_15/Code01_FriendCircles.java
index 398d911..4e83a8e 100644
--- a/src/class09_15/Code01_FriendCircles.java
+++ b/src/class09_15/Code01_FriendCircles.java
@@ -5,6 +5,19 @@ package class09_15;
 // 可以直接通过
 public class Code01_FriendCircles {
 
+	public static int findCircleNum(int[][] M) {
+		int N = M.length;
+		UnionFind unionFind = new UnionFind(N);
+		for (int i = 0; i < N; i++) {
+			for (int j = i + 1; j < N; j++) {
+				if (M[i][j] == 1) {
+					unionFind.union(i, j);
+				}
+			}
+		}
+		return unionFind.sets();
+	}
+
 	public static class UnionFind {
 		private int[] parent;
 		private int[] size;
@@ -54,16 +67,4 @@ public class Code01_FriendCircles {
 		}
 	}
 
-	public static int findCircleNum(int[][] M) {
-		int N = M.length;
-		UnionFind unionFind = new UnionFind(N);
-		for (int i = 0; i < N; i++) {
-			for (int j = i + 1; j < N; j++) {
-				if (M[i][j] == 1) {
-					unionFind.union(i, j);
-				}
-			}
-		}
-		return unionFind.sets();
-	}
 }