1329. Sort the Matrix Diagonally Medium

1/**
2 * [1329] Sort the Matrix Diagonally
3 *
4 * A matrix diagonal is a diagonal line of cells starting from some cell in either the topmost row or leftmost column and going in the bottom-right direction until reaching the matrix's end. For example, the matrix diagonal starting from mat[2][0], where mat is a 6 x 3 matrix, includes cells mat[2][0], mat[3][1], and mat[4][2].
5 * Given an m x n matrix mat of integers, sort each matrix diagonal in ascending order and return the resulting matrix.
6 *  
7 * Example 1:
8 * <img alt="" src="https://assets.leetcode.com/uploads/2020/01/21/1482_example_1_2.png" style="width: 500px; height: 198px;" />
9 * Input: mat = [[3,3,1,1],[2,2,1,2],[1,1,1,2]]
10 * Output: [[1,1,1,1],[1,2,2,2],[1,2,3,3]]
11 * 
12 * Example 2:
13 * 
14 * Input: mat = [[11,25,66,1,69,7],[23,55,17,45,15,52],[75,31,36,44,58,8],[22,27,33,25,68,4],[84,28,14,11,5,50]]
15 * Output: [[5,17,4,1,52,7],[11,11,25,45,8,69],[14,23,25,44,58,15],[22,27,31,36,50,66],[84,28,75,33,55,68]]
16 * 
17 *  
18 * Constraints:
19 * 
20 * 	m == mat.length
21 * 	n == mat[i].length
22 * 	1 <= m, n <= 100
23 * 	1 <= mat[i][j] <= 100
24 * 
25 */
26pub struct Solution {}
27
28// problem: https://leetcode.com/problems/sort-the-matrix-diagonally/
29// discuss: https://leetcode.com/problems/sort-the-matrix-diagonally/discuss/?currentPage=1&orderBy=most_votes&query=
30
31// submission codes start here
32
33impl Solution {
34    pub fn diagonal_sort(mat: Vec<Vec<i32>>) -> Vec<Vec<i32>> {
35        vec![]
36    }
37}
38
39// submission codes end
40
41#[cfg(test)]
42mod tests {
43    use super::*;
44
45    #[test]
46    fn test_1329() {
47    }
48}
49