867. Transpose Matrix。

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 <= A.length <= 1000
1 <= A[0].length <= 1000

原文链接：https://leetcode.com/problems/transpose-matrix/

---

题目很简单，将原来的数组进行转置即可。

---

如果原来矩阵为m * n，那么就申请一个n * m的矩阵，然后填满就行了。

class Solution {
public:
    vector<vector<int>> transpose(vector<vector<int>>& A) {
        vector<vector<int>> result(A[0].size(),vector<int>(A.size()));//申请一个新的数组，大小为转置之后的
        int i,j;
        for(i=0;i<A[0].size();i++) {
            for(j=0;j<A.size();j++) {
                result[i][j] = A[j][i];
            }
        }
        return result;
    }
};