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.

click to show follow up.

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) 
    {
        int n = matrix.size();
        if(n == 0)
            return;
        int m = matrix[0].size();
        if(m == 0)
            return;
        bool* flag_row = new bool[n];
        for(int i=0; i<n; i++)
            flag_row[i] = false;
        bool* flag_col = new bool[m];
        for(int i=0; i<m; i++)
            flag_col[i] = false;
        for(int i=0; i<n; i++)
        {
            for(int j=0; j<m; j++)
            {
                if(matrix[i][j] == 0)
                {
                    flag_row[i] = true;
                    flag_col[j] = true;
                }
            }
        }
        for(int i=0; i<n; i++)
        {
            if(flag_row[i] == true)
            {
                for(int j=0; j<m; j++)
                    matrix[i][j] = 0;
            }
        }
        for(int i=0; i<m; i++)
        {
            if(flag_col[i] == true)
            {
                for(int j=0; j<n; j++)
                    matrix[j][i] = 0;
            }
        }
        return ;
    }
};


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值