867. Transpose Matrix
题目
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 1:
Input: [[1,2,3],[4,5,6],[7,8,9]]
Output: [[1,4,7],[2,5,8],[3,6,9]]
Example 2:
Input: [[1,2,3],[4,5,6]]
Output: [[1,4],[2,5],[3,6]]
Note:
1 <= A.length <= 1000
1 <= A[0].length <= 1000
解决
需要将矩阵的行变为列,列变为行。即A[i][j] → A[j][i]
。
设矩阵的大小为r * c
1.遍历方法
- 时间复杂度:O(r * c)
- 空间复杂度:O(r * c)
class Solution {
public:
vector<vector<int>> transpose(vector<vector<int>>& A) {
vector<vector<int> > result;
int row = A.size();
if (row == 0) return result;
int col = A[0].size();
for (int i = 0; i < col; i++) {
vector<int> temp;
for (int j = 0; j < row; j++) {
temp.push_back(A[j][i]);
}
result.push_back(temp);
}
return result;
}
};
2.赋值方法(遍历方法的优化)
- 时间复杂度:O(r * c)
- 空间复杂度:O(r * c)
class Solution {
public:
vector<vector<int>> transpose(vector<vector<int>>& A) {
int M = A.size(), N = A[0].size();
vector<vector<int>> B(N, vector<int>(M, 0));
for (int j = 0; j < N; j++)
for (int i = 0; i < M; i++)
B[j][i] = A[i][j];
return B;
}
};