[Leetcode]Set Matrix Zeroes

Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place.

Follow up:

Did you use extra space?
A straight forward solution using O(mn) space is probably a bad idea.
A simple improvement uses O(m + n) space, but still not the best solution.
Could you devise a constant space solution?

如果矩阵里的某个元素为0,就把该元素所在的行和列里的元素都设为0~可以用第一行和第一列来记录该行和该列是否要置为0,注意要先维护两个变量记录第一行和第一列是否要设为0~这种解法空间复杂度就为O(1);时间复杂度为O(m*n)

class Solution:
    # @param matrix, a list of lists of integers
    # RETURN NOTHING, MODIFY matrix IN PLACE.
    def setZeroes(self, matrix):
        if matrix is None or len(matrix) == 0: return
        row, col = len(matrix), len(matrix[0])
        setFirstRowZero, setFirstColZero = False, False
        for i in xrange(row):
            if matrix[i][0] == 0:
                setFirstColZero = True
                break
        for j in xrange(col):
            if matrix[0][j] == 0:
                setFirstRowZero = True
                break
        for i in xrange(1, row):
            for j in xrange(1, col):
                if matrix[i][j] == 0:
                    matrix[i][0] = 0; matrix[0][j] = 0
        for i in xrange(1, row):
            for j in xrange(1, col):
                if matrix[i][0] == 0 or matrix[0][j] == 0:
                    matrix[i][j] = 0
        if setFirstRowZero:
            for i in xrange(col):
                matrix[0][i] = 0
        if setFirstColZero:
            for i in xrange(row):
                matrix[i][0] = 0


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值