add 1329

Author: fishercoder1534

README.md

@@ -10,6 +10,7 @@ _If you like this project, please leave me a star._ ★
 |-----|----------------|---------------|--------|-------------|-------------
 |1333|[Filter Restaurants by Vegan-Friendly, Price and Distance](https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1333.java) | |Medium||
 |1331|[Rank Transform of an Array](https://leetcode.com/problems/rank-transform-of-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1331.java) | |Easy||
+|1329|[Sort the Matrix Diagonally](https://leetcode.com/problems/sort-the-matrix-diagonally/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1329.java) | |Medium||
 |1317|[Convert Integer to the Sum of Two No-Zero Integers](https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1317.java) | |Easy||
 |1305|[All Elements in Two Binary Search Trees](https://leetcode.com/problems/all-elements-in-two-binary-search-trees/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1305.java) | |Medium||
 |1304|[Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1304.java) | |Easy||

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

@@ -0,0 +1,57 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.List;
+
+/**
+ * 1329. Sort the Matrix Diagonally
+ *
+ * Given a m * n matrix mat of integers,
+ * sort it diagonally in ascending order from the top-left to the bottom-right then return the sorted array.
+ *
+ * Example 1:
+ * Input: mat = [[3,3,1,1],[2,2,1,2],[1,1,1,2]]
+ * Output: [[1,1,1,1],[1,2,2,2],[1,2,3,3]]
+ *
+ * Constraints:
+ * m == mat.length
+ * n == mat[i].length
+ * 1 <= m, n <= 100
+ * 1 <= mat[i][j] <= 100
+ * */
+public class _1329 {
+    public static class Solution1 {
+        public int[][] diagonalSort(int[][] mat) {
+            int m = mat.length;
+            int n = mat[0].length;
+            int[][] sorted = new int[m][n];
+            for (int i = m - 1; i >= 0; i--) {
+                int iCopy = i;
+                List<Integer> list = new ArrayList<>();
+                for (int j = 0; j < n && iCopy < m; j++, iCopy++) {
+                    list.add(mat[iCopy][j]);
+                }
+                Collections.sort(list);
+                iCopy = i;
+                for (int j = 0; j < n && iCopy < m; j++, iCopy++) {
+                    sorted[iCopy][j] = list.get(j);
+                }
+            }
+
+            for (int j = n - 1; j > 0; j--) {
+                int jCopy = j;
+                List<Integer> list = new ArrayList<>();
+                for (int i = 0; i < m && jCopy < n; i++, jCopy++) {
+                    list.add(mat[i][jCopy]);
+                }
+                Collections.sort(list);
+                jCopy = j;
+                for (int i = 0; i < m && jCopy < n; i++, jCopy++) {
+                    sorted[i][jCopy] = list.get(i);
+                }
+            }
+            return sorted;
+        }
+    }
+}