Leetcode 867. Transpose Matrix | | Leetcode 867. Transpose Matrix 文章作者:Tyan博客:noahsnail.com | CSDN | 简书 1. Description 2. Solution12345678910111213141516171819class 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; }}; Reference https://leetcode.com/problems/transpose-matrix/description/ 如果有收获,可以请我喝杯咖啡! 赏 微信打赏 支付宝打赏