refactor 200

fishercoder1534 · fishercoder1534 · commit aab634e977f8 · 2017-08-29T08:19:37.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_200.java b/src/main/java/com/fishercoder/solutions/_200.java
@@ -26,7 +26,7 @@
  */
 public class _200 {
 
-    public static class DFSSolution {
+    public static class Solution1 {
 
         public int numIslands(char[][] grid) {
             if (grid == null || grid.length == 0) {
@@ -58,7 +58,7 @@ void dfs(char[][] grid, int i, int j, int m, int n) {
         }
     }
 
-    public static class UnionFindSolution {
+    public static class Solution2 {
 
         class UnionFind {
             int count;
diff --git a/src/test/java/com/fishercoder/_200Test.java b/src/test/java/com/fishercoder/_200Test.java
@@ -7,14 +7,14 @@
 import static org.junit.Assert.assertEquals;
 
 public class _200Test {
-    private static _200.DFSSolution dfsSolution;
-    private static _200.UnionFindSolution unionFindSolution;
+    private static _200.Solution1 solution1;
+    private static _200.Solution2 solution2;
     private static char[][] grid;
 
     @Before
     public void setup() {
-        dfsSolution = new _200.DFSSolution();
-        unionFindSolution = new _200.UnionFindSolution();
+        solution1 = new _200.Solution1();
+        solution2 = new _200.Solution2();
     }
 
     @Test
@@ -24,14 +24,14 @@ public void test1() {
                 {'0', '1', '0'},
                 {'1', '1', '1'},
         };
-        assertEquals(1, dfsSolution.numIslands(grid));
+        assertEquals(1, solution1.numIslands(grid));
 
         grid = new char[][]{
                 {'1', '1', '1'},
                 {'0', '1', '0'},
                 {'1', '1', '1'},
         };
-        assertEquals(1, unionFindSolution.numIslands(grid));
+        assertEquals(1, solution2.numIslands(grid));
     }
 
     @Test
@@ -42,15 +42,15 @@ public void test2() {
                 {'1', '1', '0', '0', '0'},
                 {'0', '0', '0', '0', '0'},
         };
-        assertEquals(1, dfsSolution.numIslands(grid));
+        assertEquals(1, solution1.numIslands(grid));
 
         grid = new char[][]{
                 {'1', '1', '1', '1', '0'},
                 {'1', '1', '0', '1', '0'},
                 {'1', '1', '0', '0', '0'},
                 {'0', '0', '0', '0', '0'},
         };
-        assertEquals(1, unionFindSolution.numIslands(grid));
+        assertEquals(1, solution2.numIslands(grid));
     }
 
     @Test
@@ -61,15 +61,15 @@ public void test3() {
                 {'0', '0', '1', '0', '0'},
                 {'0', '0', '0', '1', '1'},
         };
-        assertEquals(3, dfsSolution.numIslands(grid));
+        assertEquals(3, solution1.numIslands(grid));
 
         grid = new char[][]{
                 {'1', '1', '0', '0', '0'},
                 {'1', '1', '0', '0', '0'},
                 {'0', '0', '1', '0', '0'},
                 {'0', '0', '0', '1', '1'},
         };
-        assertEquals(3, unionFindSolution.numIslands(grid));
+        assertEquals(3, solution2.numIslands(grid));
     }
 
 }

Original file line number	Diff line number	Diff line change
`@@ -26,7 +26,7 @@`
`26`	`26`	`*/`
`27`	`27`	`public class _200 {`
`28`	`28`
`29`		`- public static class DFSSolution {`
	`29`	`+ public static class Solution1 {`
`30`	`30`
`31`	`31`	`public int numIslands(char[][] grid) {`
`32`	`32`	`if (grid == null \|\| grid.length == 0) {`
`@@ -58,7 +58,7 @@ void dfs(char[][] grid, int i, int j, int m, int n) {`
`58`	`58`	`}`
`59`	`59`	`}`
`60`	`60`
`61`		`- public static class UnionFindSolution {`
	`61`	`+ public static class Solution2 {`
`62`	`62`
`63`	`63`	`class UnionFind {`
`64`	`64`	`int count;`