Update solution 130

Author: yanglbme

solution/130.Surrounded Regions/README.md

@@ -38,7 +38,7 @@ class Solution {
         int x;
         int y;
 
-        public Point(int x, int y) {
+        Point(int x, int y) {
             this.x = x;
             this.y = y;
         }
@@ -91,9 +91,8 @@ class Solution {
 
         while (!queue.isEmpty()) {
             Point p = queue.poll();
-            // 获取下一层所有有效坐标点
+            // 获取下一层所有有效坐标点，并加入队列
             List<Point> points = getNextLevelValidPoints(board, p.x, p.y);
-
             for (Point point : points) {
                 queue.offer(point);
             }
@@ -132,7 +131,7 @@ class Solution {
         int m = board.length;
         int n = board[0].length;
         // 当前坐标对应的值是'O'，才算有效
-        return (i < 0 || i > m - 1 || j < 0 || j > n - 1 || board[i][j] != 'O') ? false : true;
+        return i >= 0 && i <= m - 1 && j >= 0 && j <= n - 1 && board[i][j] == 'O';
     }
 
 }

solution/130.Surrounded Regions/Solution.java

@@ -7,7 +7,7 @@ private class Point {
         int x;
         int y;
 
-        public Point(int x, int y) {
+        Point(int x, int y) {
             this.x = x;
             this.y = y;
         }
@@ -46,7 +46,6 @@ public void solve(char[][] board) {
 
     /**
      * 广度优先搜索
-     * 
      * @param board
      * @param i
      * @param j
@@ -61,9 +60,8 @@ private void bfs(char[][] board, int i, int j) {
 
         while (!queue.isEmpty()) {
             Point p = queue.poll();
-            // 获取下一层所有有效坐标点
+            // 获取下一层所有有效坐标点，并加入队列
             List<Point> points = getNextLevelValidPoints(board, p.x, p.y);
-
             for (Point point : points) {
                 queue.offer(point);
             }
@@ -73,7 +71,6 @@ private void bfs(char[][] board, int i, int j) {
 
     /**
      * 获取下一层所有有效坐标点，将这些坐标点修改为 'Y' 并返回
-     * 
      * @param board
      * @param i
      * @param j
@@ -94,7 +91,6 @@ private List<Point> getNextLevelValidPoints(char[][] board, int i, int j) {
 
     /**
      * 判断坐标是否有效
-     * 
      * @param board
      * @param i
      * @param j
@@ -104,7 +100,7 @@ private boolean isValid(char[][] board, int i, int j) {
         int m = board.length;
         int n = board[0].length;
         // 当前坐标对应的值是'O'，才算有效
-        return (i < 0 || i > m - 1 || j < 0 || j > n - 1 || board[i][j] != 'O') ? false : true;
+        return i >= 0 && i <= m - 1 && j >= 0 && j <= n - 1 && board[i][j] == 'O';
     }
 
 }