iShiBin
diff --git a/‎src/main/java/com/fishercoder/solutions/DiagonalTraverse.java
-81 b/‎src/main/java/com/fishercoder/solutions/DiagonalTraverse.java
-81
diff --git a/‎src/main/java/com/fishercoder/solutions/_498.java
+3-2 b/‎src/main/java/com/fishercoder/solutions/_498.java
+3-2
diff --git a/‎src/test/java/com/fishercoder/DiagonalTraverseTest.java
-37 b/‎src/test/java/com/fishercoder/DiagonalTraverseTest.java
-37
@@ -3,7 +3,8 @@
 /**
  * 498. Diagonal Traverse
  *
- *  Given a matrix of M x N elements (M rows, N columns), return all elements of the matrix in diagonal order as shown in the below image.
+ *  Given a matrix of M x N elements (M rows, N columns), return all elements of the matrix in diagonal order
+ *  as shown in the below image.
 
  Example:
 
@@ -22,7 +23,7 @@
  */
 public class _498 {
 
-    /**Credit: https://discuss.leetcode.com/topic/77865/concise-java-solution/2
+    /**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.*/
     public int[] findDiagonalOrder(int[][] matrix) {