diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/sort_matrix_diagonal.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/sort_matrix_diagonal.cpp')
-rw-r--r-- | other/sort_matrix_diagonal.cpp | 21 |
1 files changed, 0 insertions, 21 deletions
diff --git a/other/sort_matrix_diagonal.cpp b/other/sort_matrix_diagonal.cpp deleted file mode 100644 index 61f3486..0000000 --- a/other/sort_matrix_diagonal.cpp +++ /dev/null @@ -1,21 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - unordered_map<int, vector<int>> umv; - vector<vector<int>> diagonalSort(vector<vector<int>> &mat) { - int m = mat.size(), n = mat[0].size(); - for (int i = 0; i < m; i++) - for (int j = 0; j < n; j++) - umv[i - j].push_back(mat[i][j]); - for (int i = -(n - 1); i < m; i++) - sort(umv[i].begin(), umv[i].end()); - for (int i = m - 1; i >= 0; i--) { - for (int j = n - 1; j >= 0; j--) { - mat[i][j] = umv[i - j].back(); - umv[i - j].pop_back(); - } - } - return mat; - } -}; |