Add solution 1329

leetcode/1329.Sort-the-Matrix-Diagonally/1329. Sort the Matrix Diagonally.go

@@ -0,0 +1,24 @@
+package leetcode
+
+import (
+	"sort"
+)
+
+func diagonalSort(mat [][]int) [][]int {
+	m, n, diagonalsMap := len(mat), len(mat[0]), make(map[int][]int)
+	for i := 0; i < m; i++ {
+		for j := 0; j < n; j++ {
+			diagonalsMap[i-j] = append(diagonalsMap[i-j], mat[i][j])
+		}
+	}
+	for _, v := range diagonalsMap {
+		sort.Ints(v)
+	}
+	for i := 0; i < m; i++ {
+		for j := 0; j < n; j++ {
+			mat[i][j] = diagonalsMap[i-j][0]
+			diagonalsMap[i-j] = diagonalsMap[i-j][1:]
+		}
+	}
+	return mat
+}