【leetcode】73. Set Matrix Zeroes【java】

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?


Analysis

This problem should be solved in place, i.e., no other array should be used. We can use the first column and the first row to track if a row/column should be set to 0.

Since we used the first row and first column to mark the zero row/column, the original values are changed.

Specifically, given, the following matrix
set-matrix-zero-1
this problem can be solved by following 4 steps:

Step 1:
First row contains zero = true;
First column contains zero = false;

Step 2: use first row and column to mark zero row and column.
set-matrix-zero-2

Step 3: set each elements by using marks in first row and column.
set-matrix-zero-3

Step 4: Set first column and row by using marks in step 1.
set-matrix-zero-4

Java Solution

public class Solution {
    public void setZeroes(int[][] matrix) {
        int m = matrix.length;
        int n = matrix[0].length;
        Boolean first_row = false;
        Boolean first_col = false;
        //set first row and column zero or not
        for (int i = 0; i < m; i++){
            if (matrix[i][0] == 0){
                first_col = true;
                break;
            }
        }
        for (int j = 0; j < n; j++){
            if (matrix[0][j] == 0){
                first_row = true;
                break;
            }
            
        }
        //mark zeros on first row and column
        for (int i = 1; i < m; i++){
            for (int j = 1; j < n; j++){
                if (matrix[i][j] == 0){
                    matrix[0][j] = 0;
                    matrix[i][0] = 0;
                }
            }
        }
        //use mark to set elements
        for (int i = 1; i < m ; i++){
            if (matrix[i][0] == 0){
                for (int j = 1; j < n; j++){
                    matrix[i][j] = 0;
                }
            }
        }
        for (int j = 1; j < n ; j++){
            if (matrix[0][j] == 0){
                for (int i = 1; i < m; i++){
                    matrix[i][j] = 0;
                }
            }
        }
        //set first column and row
        if (first_row){
            for (int j = 0; j < n; j++){
                matrix[0][j] = 0;
            }
        }
        if (first_col){
            for (int i = 0; i < m; i++){
                matrix[i][0] = 0;
            }
        }
    }
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值