目录结构
1.题目
给定一个矩阵 A
, 返回 A
的转置矩阵。
矩阵的转置是指将矩阵的主对角线翻转,交换矩阵的行索引与列索引。
示例:
输入:[[1,2,3],[4,5,6],[7,8,9]]
输出:[[1,4,7],[2,5,8],[3,6,9]]
输入:[[1,2,3],[4,5,6]]
输出:[[1,4],[2,5],[3,6]]
提示:
1 <= A.length <= 1000
1 <= A[0].length <= 1000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/transpose-matrix
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
2.题解
public class Solution867 {
@Test
public void test867() {
int[][] A = {{1, 2, 3, 4,}, {5, 6, 7, 8}};
int[][] expected = {{1, 5}, {2, 6}, {3, 7}, {4, 8}};
assertEquals(expected, transpose(A));
}
public int[][] transpose(int[][] A) {
int m = A.length, n = A[0].length;
int[][] B = new int[n][m];
int r, c = 0;
for (int[] ints : A) {
r = 0;
for (int num:ints) {
B[r++][c] = num;
}
c++;
}
return B;
}
}
- 时间复杂度:
- 空间复杂度: