feat: add java solution to lc problem: NO.1329. Sort the Matrix Diagonally (doocs#548)

Author: hongyiheng

solution/1300-1399/1329.Sort the Matrix Diagonally/README.md

@@ -59,7 +59,29 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int[][] diagonalSort(int[][] mat) {
+        for (int i = 0; i < mat.length; i++) {
+            handler(mat, i, 0);
+        }
+        for (int i = 0; i < mat[0].length; i++) {
+            handler(mat, 0, i);
+        }
+        return mat;
+    }
+
+    public void handler(int[][] mat, int i, int j) {
+        for (; i < mat.length && j < mat[0].length; i++, j++) {
+            for (int k = i + 1, p = j + 1; k < mat.length && p < mat[0].length; k++, p++) {
+                if (mat[k][p] < mat[i][j]){
+                    int temp = mat[k][p];
+                    mat[k][p] = mat[i][j];
+                    mat[i][j] = temp;
+                }
+            }
+        }    
+    }
+}
 ```
 
 ### **...**

solution/1300-1399/1329.Sort the Matrix Diagonally/README_EN.md

@@ -47,7 +47,29 @@
 ### **Java**
 
 ```java
-
+class Solution {
+    public int[][] diagonalSort(int[][] mat) {
+        for (int i = 0; i < mat.length; i++) {
+            handler(mat, i, 0);
+        }
+        for (int i = 0; i < mat[0].length; i++) {
+            handler(mat, 0, i);
+        }
+        return mat;
+    }
+
+    public void handler(int[][] mat, int i, int j) {
+        for (; i < mat.length && j < mat[0].length; i++, j++) {
+            for (int k = i + 1, p = j + 1; k < mat.length && p < mat[0].length; k++, p++) {
+                if (mat[k][p] < mat[i][j]){
+                    int temp = mat[k][p];
+                    mat[k][p] = mat[i][j];
+                    mat[i][j] = temp;
+                }
+            }
+        }    
+    }
+}
 ```
 
 ### **...**

solution/1300-1399/1329.Sort the Matrix Diagonally/Solution.java

@@ -0,0 +1,23 @@
+class Solution {
+    public int[][] diagonalSort(int[][] mat) {
+        for (int i = 0; i < mat.length; i++) {
+            handler(mat, i, 0);
+        }
+        for (int i = 0; i < mat[0].length; i++) {
+            handler(mat, 0, i);
+        }
+        return mat;
+    }
+
+    public void handler(int[][] mat, int i, int j) {
+        for (; i < mat.length && j < mat[0].length; i++, j++) {
+            for (int k = i + 1, p = j + 1; k < mat.length && p < mat[0].length; k++, p++) {
+                if (mat[k][p] < mat[i][j]){
+                    int temp = mat[k][p];
+                    mat[k][p] = mat[i][j];
+                    mat[i][j] = temp;
+                }
+            }
+        }
+    }
+}