[leetcode]1329. 将矩阵按对角线排序

class Solution {
public:
    vector<vector<int>> diagonalSort(vector<vector<int>>& mat) {
        int m = mat.size();
        int n = mat[0].size();
        vector<vector<int>>nums;
        for(int k = m -1; k >= 0; k--)
        {
            vector<int>temp;
            for(int j = 0,i = k ; i < m && j < n; j++,i++)
            {
                temp.push_back(mat[i][j]);
            }
            sort(temp.begin(), temp.end());
            nums.push_back(temp);
        }
        for(int k = 1; k < n; k++)
        {
            vector<int>temp;
            for(int j = k,i = 0 ; i < m && j < n; j++,i++)
            {
                temp.push_back(mat[i][j]);
            }
            sort(temp.begin(), temp.end());
            nums.push_back(temp);
        }
        //回填
        int idx = 0;
        for(int k = m -1; k >= 0; k--)
        {
            for(int j = 0,i = k, d = 0; i < m && j < n; j++,i++,d++)
            {
                mat[i][j] = nums[idx][d];
            }
            idx++;
        }
        for(int k = 1; k < n; k++)
        {
            for(int j = k,i = 0,d = 0 ; i < m && j < n; j++,i++,d++)
            {
                mat[i][j] = nums[idx][d];
            }
            idx++;
        }
        
        return mat;
    }
};
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48