# [LeetCode]867. Transpose Matrix 解题报告(C++)

[LeetCode]867. Transpose Matrix 解题报告(C++)

题目描述

Given a matrix A, return the transpose of A.

The transpose of a matrix is the matrix flipped over it’s main diagonal, switching the row and column indices of the matrix.

Example 1:

Input: [[1,2,3],[4,5,6],[7,8,9]]
Output: [[1,4,7],[2,5,8],[3,6,9]]

Example 2:

Input: [[1,2,3],[4,5,6]]
Output: [[1,4],[2,5],[3,6]]

Note:

1. 1 <= A.length <= 1000
2. 1 <= A[0].length <= 1000

题目大意

• 给定一个矩阵,将其转置

解题思路

• 这道题主要是要学会如何分配 二维的vector 空间
• 然后做转置

代码实现:

class Solution {
public:
    vector<vector<int>> transpose(vector<vector<int>>& A) {
    int row = A.size();
    int col = A[0].size();

    vector < vector<int> > res;
    res.resize(col);
    for (int i = 0; i < res.size(); i++) {
        res[i].resize(row);
    }

    for (int i = 0; i < row; i++) {
        for (int j = 0; j < col; j++) {
            res[j][i] = A[i][j];
        }
    }

    return res;
    }
};

小结

• 注意如何开辟二维空间.