LeetCode Set Matrix Zeroes

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?

Solution:

class Solution {
public:
    void setZeroes(vector<vector<int> > &matrix) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(matrix.empty()||matrix[0].empty())
            return;
        int count=0,next=0;
        for(int i=0;i<matrix.size()-1;++i){
            for(int j=0;j<matrix[i].size();++j){
                if(matrix[i][j]==0){
                    --count;
                    if(matrix[i+1][j]!=0)
                        ++next;
                    matrix[i+1][j]=0;
                }
            }
            if(count<0){
                matrix[i].assign(matrix[i].size(),0);
            }
            count=next;
            next=0;
        }
        for(int i=0;i<matrix.back().size();++i){
            if(matrix.back()[i]==0){
                --count;
                for(int j=0;j<matrix.size()-1;++j){
                    matrix[j][i]=0;
                }
            }
        }
        if(count<0){
            matrix.back().assign(matrix.back().size(),0);
        }
    }
};

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值