edit 529

fishercoder1534 · fishercoder1534 · commit c96e5d20c333 · 2017-05-19T07:30:05.000-07:00
diff --git a/README.md b/README.md
@@ -53,7 +53,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |532|[K-diff Pairs in an Array](https://leetcode.com/problems/k-diff-pairs-in-an-array/)|[Solution](../master/src/main/java/com/stevesun/solutions/KdiffPairsinanArray.java) | O(n) |O(n) | Easy | HashMap
 |531|[Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i/)|[Solution](../master/src/main/java/com/stevesun/solutions/LonelyPixelI.java) | O(m*n) |O(1) | Medium | 
 |530|[Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/)|[Solution](../master/src/main/java/com/stevesun/solutions/MinimumAbsoluteDifferenceinBST.java) | O(n) |O(n) | Easy| DFS
-|529|[Minesweeper](https://leetcode.com/problems/minesweeper/)|[Solution](../master/src/main/java/com/stevesun/solutions/Minesweeper.java) | O(m*n) |O(k) | Medium | BFS
+|529|[Minesweeper](https://leetcode.com/problems/minesweeper/)|[Solution](../master/src/main/java/com/stevesun/solutions/_529.java) | O(m*n) |O(k) | Medium | BFS
 |526|[Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement/)|[Solution](../master/src/main/java/com/stevesun/solutions/BeautifulArrangement.java) | O(n) |O(h) | Medium | Backtracking
 |525|[Contiguous Array](https://leetcode.com/problems/contiguous-array/)|[Solution](../master/src/main/java/com/stevesun/solutions/_525.java) | O(n) |O(n) | Medium | HashMap
 |524|[Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/)|[Solution](../master/src/main/java/com/stevesun/solutions/_524.java) | O(n) |O(n) | Medium | Sort
diff --git a/src/main/java/com/stevesun/solutions/_529.java b/src/main/java/com/stevesun/solutions/_529.java
@@ -58,7 +58,7 @@ The click position will only be an unrevealed square ('M' or 'E'), which also me
  The input board won't be a stage when game is over (some mines have been revealed).
  For simplicity, not mentioned rules should be ignored in this problem. For example, you don't need to reveal all the unrevealed mines when the game is over, consider any cases that you will win the game or flag any squares.
  */
-public class Minesweeper {
+public class _529 {
     public char[][] updateBoard(char[][] board, int[] click) {
         int m = board.length, n = board[0].length;
         Queue<int[]> queue = new LinkedList();
