Leetcode 73. Set Matrix Zeroes

Reference.

public class Solution {
    public void setZeroes(int[][] matrix) {
        int row = matrix.length;
        int col = matrix[0].length;
        
        // determine if the first row and column need to set zero first
        boolean setFirstRow = false, setFirstCol = false;
        for (int i=0; i<col; i++)
            if (matrix[0][i] == 0) setFirstRow = true;
        for (int j=0; j<row; j++)
            if (matrix[j][0] == 0) setFirstCol = true;
            
        // scan rest of the matrix, set the first number as 0 for every row and column if matrix[i][j] == 0 
        for (int i=1; i<row; i++)
            for (int j=1; j<col; j++)
                if (matrix[i][j] == 0)
                    matrix[0][j] = matrix[i][0] = 0;
                    
        // fill the columns with zeros by scanning the first row
        // note that starting from matrix[0][1] (*)
        for (int j=1; j<col; j++)
            if (matrix[0][j] == 0) 
                for (int i=1; i<row; i++)
                    matrix[i][j] = 0;
        

        // fill the rows with zeros by scanning the first column
        // note that starting from matrix[1][0]
        for (int i=1; i<row; i++)
            if (matrix[i][0] == 0) 
                for (int j=1; j<col; j++)
                    matrix[i][j] = 0;
    
        // check if first row or column needs to fill with zeros
        if (setFirstRow)
            for (int j=0; j<col; j++)
                matrix[0][j] = 0;
        if (setFirstCol)
            for (int i=0; i<row; i++)
                matrix[i][0] = 0;
    }
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值