edit 130

fishercoder1534 · fishercoder1534 · commit f0af706b21d0 · 2017-07-15T17:10:17.000-07:00
diff --git a/README.md b/README.md
@@ -419,7 +419,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |134|[Gas Station](https://leetcode.com/problems/gas-station/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_134.java)| O(n)|O(1) | Medium| Greedy
 |133|[Clone Graph](https://leetcode.com/problems/clone-graph/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_133.java)| O(n)|O(n) | Medium| HashMap, BFS, Graph 
 |132|[Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/)|[Solution](../master/src/main/java/com/fishercoder/solutions/ImplementQueueUsingStacks.java)| O(n)|O(n) | Easy| Stack, Queue
-|130|[Surrounded Regions](https://leetcode.com/problems/surrounded-regions/)|[Solution](../master/src/main/java/com/fishercoder/solutions/SurroundedRegionsBFS.java)| O(?)|O(?) | Medium|
+|130|[Surrounded Regions](https://leetcode.com/problems/surrounded-regions/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_130.java)| O(?)|O(?) | Medium|
 |129|[Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/SumRootToLeafNumbers.java)| O(n)|O(h) | Medium| DFS
 |127|[Word Ladder](https://leetcode.com/problems/word-ladder/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_127.java)| O(?)|O(?) | Medium| BFS
 |125|[Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_125.java)| O(n)|O(1) | Easy| Two Pointers
diff --git a/src/main/java/com/fishercoder/solutions/_130.java b/src/main/java/com/fishercoder/solutions/_130.java
@@ -3,6 +3,8 @@
 import java.util.*;
 
 /**
+ * 130. Surrounded Regions
+ *
  * Given a 2D board containing 'X' and 'O' (the letter O), capture all regions surrounded by 'X'.
 
  A region is captured by flipping all 'O's into 'X's in that surrounded region.
@@ -12,17 +14,16 @@
  X O O X
  X X O X
  X O X X
+
  After running your function, the board should be:
 
  X X X X
  X X X X
  X X X X
  X O X X
- Show Tags
- Show Similar Problems
-
  */
-public class SurroundedRegionsBFS {
+public class _130 {
+
     /**I won't call this problem hard, it's just confusing, you'll definitely want to clarify what the problem means before coding.
      * This problem eactually means:
      * any grid that is 'O' but on the four edges, will never be marked to 'X';
@@ -36,7 +37,8 @@ public void solve(char[][] board) {
         if(board == null || board.length == 0 || board[0].length == 0) return;
         int m = board.length, n = board[0].length;
         Queue<int[]> queue = new LinkedList();
-        //check first row and last row and mark all those '0' on these two rows to be '+' to let them be different from other 'O', at the same time, we put them into the queue to get ready for a BFS to mark all those adjacent 'O' nodes to '+' as well
+        //check first row and last row and mark all those '0' on these two rows to be '+' to let them be different from other 'O',
+        //at the same time, we put them into the queue to get ready for a BFS to mark all those adjacent 'O' nodes to '+' as well
         for(int j = 0; j < n; j++){
             if(board[0][j] == 'O') {
                 board[0][j] = '+';
