【leetcode】867. Transpose Matrix

Problem Description

Link

Solution

class Solution:
    def transpose(self, A):
        """
        :type A: List[List[int]]
        :rtype: List[List[int]]
        """
        m = len(A)  # 行
        n = len(A[0])  # 列
        result = [[None for i in range(m)] for j in range(n)] 

        for j in range(n):
            for i in range(m):
                result[j][i] = A[i][j]

        return result

Solution Samples

#Runtime: 56ms
class Solution(object):
    def transpose(self, A):
        return zip(*A)

##Runtime: 52ms
class Solution(object):
    def transpose(self, A):
        m, n = len(A), len(A[0])
        return [[A[i][j] for i in range(m)] for j in range(n)]

Conclusion

1. zip()函数用于将可迭代的对象作为参数，将对象中对应的元素打包成一个个元组，然后返回由这些元组组成的列表。
2. *Matrix 是对矩阵进行解压，如：A = [[1,2,3],[4,5,6]]，*A = [1,2,3] [4,5,6]
3. 二维list新建时必须确定大小：result = [[None for i in range(m)] for j in range(n)] ；否则会报溢出