leetcode 867. 转置矩阵

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