class Solution {
public:
vector<vector<int>> transpose(vector<vector<int>>& matrix) {
vector<vector<int>> answer;
for(int i = 0;i<matrix[0].size();i++){
vector<int> now;
for(int j=0;j<matrix.size();j++){
now.push_back(matrix[j][i]);
}
answer.push_back(now);
}
return answer;
}
};
leetcode867_2-25每日题:转置矩阵
最新推荐文章于 2021-02-25 16:13:14 发布