Array | 867. Transpose Matrix

题目：转置矩阵

方法1：

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

方法2：

class Solution {
public:
    vector<vector<int>> transpose(vector<vector<int>>& A) {
    int row = A.size();
    int col = A[0].size();

    vector < vector<int> > res;
    res.resize(col);
    for (int i = 0; i < res.size(); i++) {
        res[i].resize(row);
    }

    for (int i = 0; i < row; i++) {
        for (int j = 0; j < col; j++) {
            res[j][i] = A[i][j];
        }
    }

    return res;
    }
};