1
class Solution {
2
public int[][] transpose(int[][] matrix) {
3
int m = matrix.length;
4
int n = matrix[0].length;
5

6
int[][] trans = new int[n][m];
7

8
for (int i = 0; i < n; i++) {
9
for (int j = 0; j < m; j++) {
10
trans[i][j] = matrix[j][i];
11
}
12
}
13

14
return trans;
15
}
16
}

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0