LeetCode867. Transpose Matrix

翻转矩阵，遍历一遍原矩阵，然后行列顺序交换着将元素插入一个新矩阵。

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

        vector<vector<int>> vec_ret;
        for (int col = 0; col < maxcol; ++col)
        {
            vector<int> vec;
            for (int row = 0; row < maxrow; ++row)
                vec.push_back(A[row][col]);
            vec_ret.push_back(vec);
        }

        return vec_ret;
    }
};

static auto makeMeFast = [](){
    // turn off sync
    std::ios::sync_with_stdio(false);
    // untie in/out streams
    std::cin.tie(NULL);
    return 0;
}();

Runtime: 12 ms, faster than 100.00% of C++ online submissions for Transpose Matrix.