今天的每日一题太难了 做了道矩阵置零

class Solution:
    def setZeroes(self, matrix: List[List[int]]) -> None:
        """
        Do not return anything, modify matrix in-place instead.
        """
        m = len(matrix)
        n = len(matrix[0])
        seed = []
        hang_jihe = []
        for i in matrix:
            hang_jihe.append(set(i))
        lie_jihe = [set() for i in range(n)]#列

        for  i in range(m):#行
            for j in range(n):
                lie_jihe[j].add(matrix[i][j])
        


        
        for i in range(m):
            for j in range(n):
                if 0 in hang_jihe[i] or 0 in lie_jihe[j]:
                    matrix[i][j] = False
        for i in range(m):
            for j in range(n):
                if matrix[i][j] == False:
                    matrix[i][j] = 0
        
        return matrix
                    

将每一行的元素加入行集合中，将每一列的元素加入列集合中，在遍历到元素所在行集合或者列集合中有0时，将其改为False，再遍历一次，将False改为0 ，就绕开非初始化0 的重复判断。

粘贴一段大佬写的

class Solution:
    def setZeroes(self, matrix: List[List[int]]) -> None:
        """
        Do not return anything, modify matrix in-place instead.
        """
        row = len(matrix)
        col  = len(matrix[0])
        row_zero = set()
        col_zero = set()
        for i in range(row):
            for j in range(col):
                if matrix[i][j] == 0:
                    row_zero.add(i)
                    col_zero.add(j)
        for i in range(row):
            for j in range(col):
                if i in row_zero or j in col_zero:
                    matrix[i][j] = 0

他只在集合中记录了应该变成集合的行和应该变成集合的列，在遍历到相应行列时就改元素为0，佩服。