[leetcode]轉置矩陣
阿新 • • 發佈:2018-11-24
867. 轉置矩陣
給定一個矩陣 A, 返回 A 的轉置矩陣。
矩陣的轉置是指將矩陣的主對角線翻轉,交換矩陣的行索引與列索引。
示例 1:
輸入:[[1,2,3],[4,5,6],[7,8,9]]
輸出:[[1,4,7],[2,5,8],[3,6,9]]
示例 2:
輸入:[[1,2,3],[4,5,6]]
輸出:[[1,4],[2,5],[3,6]]
提示:
- 1 <= A.length <= 1000
- 1 <= A[0].length <= 1000
C++解法:
class Solution {
public :
vector<vector<int>> transpose(vector<vector<int>>& A) {
int rowNum = A.size();
int column = A[0].size();
if (rowNum == column)
{
for (int i = 0; i < rowNum; ++i)
{
for (int j = i; j < column; ++j)
{
swap(A[i][j], A[j][i]);
}
}
return A;
}
else
{
vector<vector<int>> ans(column);
for (int i = 0; i < column; ++i)
{
for (int j = 0; j < rowNum; ++j)
{
ans[i].push_back(A[j][i]);
}
}
return ans;
}
}
};