[N-0] refactor 661

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_661.java

@@ -29,56 +29,58 @@ For the point (1,1): floor(8/9) = floor(0.88888889) = 0
 
  */
 public class _661 {
-    public int[][] imageSmoother(int[][] M) {
-        if (M == null || M.length == 0) {
-            return M;
-        }
-        int m = M.length;
-        int n = M[0].length;
-        int[][] result = new int[m][n];
-        for (int i = 0; i < m; i++) {
-            for (int j = 0; j < n; j++) {
-                bfs(M, i, j, result, m, n);
+    public static class Solution1 {
+        public int[][] imageSmoother(int[][] M) {
+            if (M == null || M.length == 0) {
+                return M;
+            }
+            int m = M.length;
+            int n = M[0].length;
+            int[][] result = new int[m][n];
+            for (int i = 0; i < m; i++) {
+                for (int j = 0; j < n; j++) {
+                    bfs(M, i, j, result, m, n);
+                }
             }
+            return result;
         }
-        return result;
-    }
 
-    private void bfs(int[][] M, int i, int j, int[][] result, int m, int n) {
-        int sum = M[i][j];
-        int denominator = 1;
-        if (j + 1 < n) {
-            sum += M[i][j + 1];
-            denominator++;
-        }
-        if (i + 1 < m && j + 1 < n) {
-            sum += M[i + 1][j + 1];
-            denominator++;
-        }
-        if (i + 1 < m) {
-            sum += M[i + 1][j];
-            denominator++;
-        }
-        if (i + 1 < m && j - 1 >= 0) {
-            sum += M[i + 1][j - 1];
-            denominator++;
-        }
-        if (j - 1 >= 0) {
-            sum += M[i][j - 1];
-            denominator++;
-        }
-        if (i - 1 >= 0 && j - 1 >= 0) {
-            sum += M[i - 1][j - 1];
-            denominator++;
-        }
-        if (i - 1 >= 0) {
-            sum += M[i - 1][j];
-            denominator++;
-        }
-        if (i - 1 >= 0 && j + 1 < n) {
-            sum += M[i - 1][j + 1];
-            denominator++;
+        private void bfs(int[][] M, int i, int j, int[][] result, int m, int n) {
+            int sum = M[i][j];
+            int denominator = 1;
+            if (j + 1 < n) {
+                sum += M[i][j + 1];
+                denominator++;
+            }
+            if (i + 1 < m && j + 1 < n) {
+                sum += M[i + 1][j + 1];
+                denominator++;
+            }
+            if (i + 1 < m) {
+                sum += M[i + 1][j];
+                denominator++;
+            }
+            if (i + 1 < m && j - 1 >= 0) {
+                sum += M[i + 1][j - 1];
+                denominator++;
+            }
+            if (j - 1 >= 0) {
+                sum += M[i][j - 1];
+                denominator++;
+            }
+            if (i - 1 >= 0 && j - 1 >= 0) {
+                sum += M[i - 1][j - 1];
+                denominator++;
+            }
+            if (i - 1 >= 0) {
+                sum += M[i - 1][j];
+                denominator++;
+            }
+            if (i - 1 >= 0 && j + 1 < n) {
+                sum += M[i - 1][j + 1];
+                denominator++;
+            }
+            result[i][j] = sum / denominator;
         }
-        result[i][j] = sum / denominator;
     }
 }

src/test/java/com/fishercoder/_661Test.java

@@ -7,13 +7,13 @@
 import static org.junit.Assert.assertArrayEquals;
 
 public class _661Test {
-    private static _661 test;
+    private static _661.Solution1 solution1;
     private static int[][] M;
     private static int[][] expected;
 
     @BeforeClass
     public static void setup() {
-        test = new _661();
+        solution1 = new _661.Solution1();
     }
 
     @Test
@@ -28,7 +28,7 @@ public void test1() {
                 {0, 0, 0},
                 {0, 0, 0}
         };
-        assertArrayEquals(expected, test.imageSmoother(M));
+        assertArrayEquals(expected, solution1.imageSmoother(M));
     }
 
 }