Leetcode 867. Transpose Matrix

文章作者：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;
    }
};

Reference

1. https://leetcode.com/problems/transpose-matrix/description/