refactor 286

fishercoder1534 · fishercoder1534 · commit d24e60b2cef6 · 2018-11-27T08:36:03.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_286.java b/src/main/java/com/fishercoder/solutions/_286.java
@@ -25,7 +25,7 @@
 
  */
 public class _286 {
-    class BFSSolutionWithoutQueue {
+    public static class Solution1 {
 
         int[] dirs = new int[]{0, 1, 0, -1, 0};
 
@@ -57,7 +57,7 @@ void bfs(int[][] rooms, int i, int j, int m, int n) {
 
     }
 
-    class BFSSolutionWithAQueue {
+    public static class Solution2 {
 
         //push all gates into the queue first, and then put all its neighbours into the queue with one distance to the gate, then continue to push the rest of the nodes into the queue, and put all their neighbours into the queue with the nodes' value plus one until the queue is empty
         int[] dirs = new int[]{0, 1, 0, -1, 0};
