【LeetCode】867.转置矩阵

867.转置矩阵

思路

1. 数组

拓展

1. 【每日一题13】AcWing 754. 平方矩阵 II

代码

class Solution {
public:
    vector<vector<int>> transpose(vector<vector<int>>& matrix) {
        int n=matrix.size();
        int m=matrix[0].size();
        vector<vector<int>> res(m, vector<int>(n, 0));
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                res[j][i] = matrix[i][j];
            }
        }
        return res;
    }
};