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(m n) 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?

程序:

class Solution {
public:
    void setZeroes(vector<vector<int> > &matrix) {
        const int row = matrix.size();
        const int col = matrix[0].size();
        bool row_flg = false, col_flg = false;
         
        //判断第一行和第一列是否有零,防止被覆盖
        for (int i = 0; i < row; i++)
            if (0 == matrix[i][0]) {
                col_flg = true;
                break;
            }
        for (int i = 0; i < col; i++)
            if (0 == matrix[0][i]) {
                row_flg = true;
                break;
            }
        //遍历矩阵,用第一行和第一列记录0的位置
        for (int i = 1; i < row; i++)
            for (int j = 1; j < col; j++)
                if (0 == matrix[i][j]) {
                    matrix[i][0] = 0;
                    matrix[0][j] = 0;
                }
        //根据记录清零
        for (int i = 1; i < row; i++)
            for (int j = 1; j < col; j++)
                if (0 == matrix[i][0] || 0 == matrix[0][j])
                    matrix[i][j] = 0;
        //最后处理第一行
        if (row_flg)
            for (int i = 0; i < col; i++)
                matrix[0][i] = 0;
        if (col_flg)
            for (int i = 0; i < row; i++)
                matrix[i][0] = 0;
    }
};
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值