-
Notifications
You must be signed in to change notification settings - Fork 25
/
Copy pathSorted_matrix.java
48 lines (45 loc) · 1.18 KB
/
Sorted_matrix.java
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
// { Driver Code Starts
// Initial Template for Java
import java.io.*;
import java.util.*;
class GFG {
public static void main(String args[]) throws IOException {
BufferedReader read = new BufferedReader(new InputStreamReader(System.in));
int t = Integer.parseInt(read.readLine());
while (t-- > 0) {
int N = Integer.parseInt(read.readLine());
int v[][] = new int[N][N];
for (int i = 0; i < N; i++) {
String s[] = read.readLine().split(" ");
for (int j = 0; j < N; j++)
v[i][j] = Integer.parseInt(s[j]);
}
Solution ob = new Solution();
int ans[][] = ob.sortedMatrix(N, v);
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++)
System.out.print(ans[i][j] + " ");
System.out.println();
}
}
}
}
class Solution {
int[][] sortedMatrix(int N, int Mat[][]) {
int[] arr = new int[N * N];
int k = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
arr[k++] = Mat[i][j];
}
}
Arrays.sort(arr);
k = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
Mat[i][j] = arr[k++];
}
}
return Mat;
}
};