题目:
给定一个 m x n 的矩阵,如果一个元素为 0,则将其所在行和列的所有元素都设为 0。请使用原地算法。
示例 1:
输入: [ [1,1,1], [1,0,1], [1,1,1] ] 输出: [ [1,0,1], [0,0,0], [1,0,1] ]
示例 2:
输入: [ [0,1,2,0], [3,4,5,2], [1,3,1,5] ] 输出: [ [0,0,0,0], [0,4,5,0], [0,3,1,0] ]
解法:
class Solution(object):
def setZeroes(self, matrix):
"""
:type matrix: List[List[int]]
:rtype: void Do not return anything, modify matrix in-place instead.
"""
m = len(matrix)
n = len(matrix[0])
flag = []
for i in range(m):
for j in range(n):
if(matrix[i][j]==0):
flag.append([i,j])
p = len(flag)
for k in range(p):
for i in range(m):
for j in range(n):
if(i==flag[k][0] or j ==flag[k][1]):
matrix[i][j] = 0
貌似是最长时间的解法了QAQ