refactor 498

fishercoder1534 · fishercoder1534 · commit f083ee82e84a · 2019-05-18T08:39:21.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_498.java b/src/main/java/com/fishercoder/solutions/_498.java
@@ -23,9 +23,12 @@
  */
 public class _498 {
 
-    /**Reference: https://discuss.leetcode.com/topic/77865/concise-java-solution/2
+public static class Solutoin1 {
+    /**
+     * Reference: https://discuss.leetcode.com/topic/77865/concise-java-solution/2
      * Just keep walking the matrix, when hitting the four borders (top, bottom, left or right),
-     * just directions and keep walking.*/
+     * just directions and keep walking.
+     */
     public int[] findDiagonalOrder(int[][] matrix) {
 
         if (matrix == null || matrix.length == 0) {
@@ -62,7 +65,7 @@ public int[] findDiagonalOrder(int[][] matrix) {
             }
         }
         return result;
-
     }
+}
 
 }
diff --git a/src/test/java/com/fishercoder/_498Test.java b/src/test/java/com/fishercoder/_498Test.java
@@ -10,13 +10,13 @@
  * Created by fishercoder on 5/26/17.
  */
 public class _498Test {
-    private static _498 test;
+    private static _498.Solutoin1 solutoin1;
     private static int[][] matrix;
     private static int[] expected;
 
     @BeforeClass
     public static void setup() {
-        test = new _498();
+        solutoin1 = new _498.Solutoin1();
     }
 
     @Test
@@ -27,7 +27,7 @@ public void test1() {
                 {7, 8, 9},
         };
         expected = new int[]{1, 2, 4, 7, 5, 3, 6, 8, 9};
-        assertArrayEquals(expected, test.findDiagonalOrder(matrix));
+        assertArrayEquals(expected, solutoin1.findDiagonalOrder(matrix));
     }
 
     @Test
@@ -40,6 +40,6 @@ public void test2() {
                 {13, 14, 15},
         };
         expected = new int[]{1, 2, 4, 7, 5, 3, 6, 8, 10, 13, 11, 9, 12, 14, 15};
-        assertArrayEquals(expected, test.findDiagonalOrder(matrix));
+        assertArrayEquals(expected, solutoin1.findDiagonalOrder(matrix));
     }
 }

Original file line number	Diff line number	Diff line change
`@@ -23,9 +23,12 @@`
`23`	`23`	`*/`
`24`	`24`	`public class _498 {`
`25`	`25`
`26`		`- /**Reference: https://discuss.leetcode.com/topic/77865/concise-java-solution/2`
	`26`	`+public static class Solutoin1 {`
	`27`	`+ /**`
	`28`	`+ * Reference: https://discuss.leetcode.com/topic/77865/concise-java-solution/2`
`27`	`29`	`* Just keep walking the matrix, when hitting the four borders (top, bottom, left or right),`
`28`		`- * just directions and keep walking.*/`
	`30`	`+ * just directions and keep walking.`
	`31`	`+ */`
`29`	`32`	`public int[] findDiagonalOrder(int[][] matrix) {`
`30`	`33`
`31`	`34`	`if (matrix == null \|\| matrix.length == 0) {`
`@@ -62,7 +65,7 @@ public int[] findDiagonalOrder(int[][] matrix) {`
`62`	`65`	`}`
`63`	`66`	`}`
`64`	`67`	`return result;`
`65`		`-`
`66`	`68`	`}`
	`69`	`+}`
`67`	`70`
`68`	`71`	`}`