#include "leetcode.h" #include <vector> class Solution { public: vector<vector<int>> transpose(vector<vector<int>> &matrix) { int n = matrix.size(), m = matrix[0].size(); vector<vector<int>> ans(m, vector<int>(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<vector<int>> matrix; obj.transpose(matrix); }