sethay
diff --git a/‎src/main/java/com/fishercoder/solutions/_547.java
Lines changed: 34 additions & 32 deletions b/‎src/main/java/com/fishercoder/solutions/_547.java
Lines changed: 34 additions & 32 deletions
diff --git a/‎src/test/java/com/fishercoder/_547Test.java
Lines changed: 2 additions & 6 deletions b/‎src/test/java/com/fishercoder/_547Test.java
Lines changed: 2 additions & 6 deletions
@@ -37,48 +37,50 @@
  */
 public class _547 {
 
-    public int findCircleNum(int[][] M) {
-        if (M == null || M.length == 0 || M[0].length == 0) {
-            return 0;
-        }
-        int m = M.length;//number of rows in this matrix
-        UnionFind unionFind = new UnionFind(m);
-        for (int i = 0; i < m; i++) {
-            for (int j = i + 1; j < m; j++) {
-                if (M[i][j] == 1) {
-                    unionFind.union(i, j);
+    public static class Solution1 {
+        public int findCircleNum(int[][] M) {
+            if (M == null || M.length == 0 || M[0].length == 0) {
+                return 0;
+            }
+            int m = M.length;//number of rows in this matrix
+            UnionFind unionFind = new UnionFind(m);
+            for (int i = 0; i < m; i++) {
+                for (int j = i + 1; j < m; j++) {
+                    if (M[i][j] == 1) {
+                        unionFind.union(i, j);
+                    }
                 }
             }
+            return unionFind.count;
         }
-        return unionFind.count;
-    }
 
-    class UnionFind {
-        int count;
-        int[] root;
+        class UnionFind {
+            int count;
+            int[] root;
 
-        public UnionFind(int m) {
-            root = new int[m];
-            for (int i = 0; i < m; i++) {
-                root[i] = i;
+            public UnionFind(int m) {
+                root = new int[m];
+                for (int i = 0; i < m; i++) {
+                    root[i] = i;
+                }
+                count = m;
             }
-            count = m;
-        }
 
-        public void union(int i, int j) {
-            int x = find(root, i);
-            int y = find(root, j);
-            if (x != y) {
-                count--;
-                root[x] = y;//path compression
+            public void union(int i, int j) {
+                int x = find(root, i);
+                int y = find(root, j);
+                if (x != y) {
+                    count--;
+                    root[x] = y;//path compression
+                }
             }
-        }
 
-        public int find(int[] ids, int i) {
-            if (ids[i] == i) {
-                return i;
+            public int find(int[] ids, int i) {
+                if (ids[i] == i) {
+                    return i;
+                }
+                return find(ids, ids[i]);
             }
-            return find(ids, ids[i]);
         }
     }
 
 
@@ -1,7 +1,6 @@
 package com.fishercoder;
 
 import com.fishercoder.solutions._547;
-import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
@@ -11,19 +10,16 @@
  * Created by fishercoder on 1/9/17.
  */
 public class _547Test {
-    private static _547 test;
+    private static _547.Solution1 test;
     private static int expected;
     private static int actual;
     private static int[][] M;
 
     @BeforeClass
     public static void setup() {
-        test = new _547();
+        test = new _547.Solution1();
     }
 
-    @Before
-    public void setupForEachTest() {}
-
     @Test
     public void test1() {
         M = new int[][]{