[LeetCode] Problem 867 - Transpose Matrix

Posted on | In ,

Given a matrix A, return the transpose of A.

The transpose of a matrix is the matrix flipped over it’s main diagonal, switching the row and column indices of the matrix.

Example

No.1

Input: [[1,2,3],[4,5,6],[7,8,9]]

Output: [[1,4,7],[2,5,8],[3,6,9]]

No.2

Input: [[1,2,3],[4,5,6]]

Output: [[1,4],[2,5],[3,6]]

Note

  1. 1 <= A.length <= 1000
  2. 1 <= A[0].length <= 1000

Code

1
2
3
4
5
6
7
8
9
10
11
12
public int[][] transpose(int[][] A) {
    int m = A.length;
    int n = A[0].length;
    int[][] result = new int[n][m];

    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++)
            result[j][i] = A[i][j];
    }

    return result;
}