leetcode_867_转置矩阵

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

注意二维矩阵的初始化规定大小

vector<vector<int> > newOne(r, vector<int>(c, 0));