1329. Sort the Matrix Diagonally

Author: SinnoLn

leetcode3/이진희/1329. Sort the Matrix Diagonally.java

@@ -0,0 +1,27 @@
+import java.util.*;
+
+class Solution {
+    public int[][] diagonalSort(int[][] mat) {
+        int m = mat.length;
+        int n = mat[0].length;
+        
+        Map<Integer, PriorityQueue<Integer>> map = new HashMap<>();
+        
+        for (int i=0; i<m; i++) {
+            for (int j=0; j<n; j++) {
+                int key = i-j;
+                map.putIfAbsent(key, new PriorityQueue<>());
+                map.get(key).add(mat[i][j]);
+            }
+        }
+        
+        for (int i=0; i<m; i++) {
+            for (int j=0; j<n; j++) {
+                int key = i-j;
+                mat[i][j] = map.get(key).poll();
+            }
+        }
+        
+        return mat;
+    }
+}