# 867.transpose

**867.转置矩阵**

难度：Easy

> 给定一个矩阵 A， 返回 A 的转置矩阵。

矩阵的转置是指将矩阵的主对角线翻转，交换矩阵的行索引与列索引。

```
示例 1：

输入：[[1,2,3],[4,5,6],[7,8,9]]
输出：[[1,4,7],[2,5,8],[3,6,9]]
示例 2：

输入：[[1,2,3],[4,5,6]]
输出：[[1,4],[2,5],[3,6]]
 

提示：

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

这题题目不难，首先是获取向量A的行列，然后行列转置新建向量，并交换行列赋值即可。

```
class Solution {
public:
    vector<vector<int>> transpose(vector<vector<int>>& A) {

        int r,c;
        r= A.size();
        c= A[0].size();
        vector<vector<int>> trans(c,vector<int>(r,0));
        for(int i=0;i<c;i++)
        {

            for (int j=0;j<r;j++)
            {
                trans[i][j]=A[j][i];
            }

    }
        return trans;
    }
};
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://dfine.gitbook.io/leetcode/867.transpose.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.