Leetcode 867. Transpose Matrix
阿新 • • 發佈:2018-12-16
文章作者:Tyan 部落格:noahsnail.com | CSDN | 簡書
1. Description
2. Solution
class Solution { public: vector<vector<int>> transpose(vector<vector<int>>& A) { vector<vector<int>> result; int rows = A.size(); if(rows == 0) { return result; } int columns = A[0].size(); for(int i = 0; i < columns; i++) { vector<int> row; for(int j = 0; j < rows; j++) { row.emplace_back(A[j][i]); } result.emplace_back(row); } return result; } };