#include "leetcode.h" #include class Solution { public: vector> transpose(vector> &matrix) { int n = matrix.size(), m = matrix[0].size(); vector> ans(m, vector(n, 0)); for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) ans[j][i] = matrix[i][j]; return ans; } }; int main() { Solution obj; vector> matrix; obj.transpose(matrix); }