版权声明:博客文章都是作者辛苦整理的,转载请注明出处,谢谢! https://cloud.tencent.com/developer/article/1435037
文章作者:Tyan
博客:noahsnail.com | CSDN | 简书
class Solution {
public:
vector<vector<int>> transpose(vector<vector<int>>& A) {
vector<vector<int>> result;
int rows = A.size();
if(rows == 0) {
return result;
}
int columns = A[0].size();
for(int i = 0; i < columns; i++) {
vector<int> row;
for(int j = 0; j < rows; j++) {
row.emplace_back(A[j][i]);
}
result.emplace_back(row);
}
return result;
}
};