edit 490

fishercoder1534 · fishercoder1534 · commit 9ea962d66930 · 2017-06-17T09:07:44.000-07:00
diff --git a/README.md b/README.md
@@ -104,7 +104,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |493|[Reverse Pairs](https://leetcode.com/problems/reverse-pairs/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_493.java) | O(?) |O(?) | Hard|
 |492|[Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle/)|[Solution](../master/src/main/java/com/fishercoder/solutions/ConstructTheRectangle.java) | O(n) |O(1) | Easy| Array
 |491|[Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_491.java) | O(n!) |O(n) | Medium| Backtracking, DFS
-|490|[The Maze](https://leetcode.com/problems/the-maze/)|[Solution](../master/src/main/java/com/fishercoder/solutions/TheMaze.java) | O(m*n) |O(m*n) | Medium| BFS
+|490|[The Maze](https://leetcode.com/problems/the-maze/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_490.java) | O(m*n) |O(m*n) | Medium| BFS
 |488|[Zuma Game](https://leetcode.com/problems/zuma-game/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_488.java) | O(?) |O(?) | Hard | DFS, Backtracking
 |487|[Max Consecutive Ones II](https://leetcode.com/problems/max-consecutive-ones-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MaxConsecutiveOnesII.java) | O(n) |O(n) | Medium| Array
 |486|[Predict the Winner](https://leetcode.com/problems/predict-the-winner/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_486.java) | O(2^n) |O(n^2) | Medium | DP
diff --git a/src/main/java/com/fishercoder/solutions/_490.java b/src/main/java/com/fishercoder/solutions/_490.java
@@ -48,7 +48,7 @@
  The given maze does not contain border (like the red rectangle in the example pictures), but you could assume the border of the maze are all walls.
  The maze contains at least 2 empty spaces, and both the width and height of the maze won't exceed 100.
  */
-public class TheMaze {
+public class _490 {
     /**
      * BFS: the key part of this algorithm is that: this is a ball that won't stop rolling until it hits a wall.
      * This means we'll have to store all the empty spaces where the ball was forced to stop into the queue, these are
diff --git a/src/test/java/com/fishercoder/_490Test.java b/src/test/java/com/fishercoder/_490Test.java
@@ -1,14 +1,14 @@
 package com.fishercoder;
 
-import com.fishercoder.solutions.TheMaze;
+import com.fishercoder.solutions._490;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
 import static junit.framework.Assert.assertEquals;
 
-public class TheMazeTest {
-    private static TheMaze test;
+public class _490Test {
+    private static _490 test;
     private static boolean expected;
     private static boolean actual;
     private static int[][] maze;
@@ -17,7 +17,7 @@ public class TheMazeTest {
 
     @BeforeClass
     public static void setup(){
-        test = new TheMaze();
+        test = new _490();
     }
 
     @Before
