leetcode【867】Transpose Matrix

版权声明：本文为博主原创文章，未经允许，不得转载，如需转载请注明出处 https://blog.csdn.net/ssjdoudou/article/details/83586587

写在最前面：刷个简单题，矩阵转置，Numpy库是提供这个函数的，在我的机器学习的博客里曾经用到过，今天自己实现一下

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

算出给定的矩阵的行，列

定义一个初始化全为0的矩阵B，这个矩阵的行，列分别是给定矩阵的列，行

两层遍历赋值，输出新的转置矩阵B

class Solution(object):
    def transpose(self, A):
        """
        :type A: List[List[int]]
        :rtype: List[List[int]]
        """
        n = len(A)     # 行
        B = [[0] * n for row in range(len(A[0]))]
        print(len(A[0]))
        for i in range(n):
            for j in range(len(A[0])):
                B[j][i] = A[i][j]
        return B

离我的airpods还有两天，等的心焦，哎