[LeetCode]73. 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?

思路:先根据矩阵中的值记录下需要修改的行号和列号,然后对矩阵进行修改

public class Solution {
    public void setZeroes(int[][] matrix) {
        int [] row = new int[matrix.length];
        int [] col = new int[matrix[0].length];
        for (int i = 0; i < matrix.length; i++) {
            for (int j = 0; j < matrix[0].length;j++) {
                if (matrix[i][j] == 0) {
                    row[i] = 1;
                    col[j] = 1;
                }
            }
        }
       for (int i = 0; i < matrix.length; i++) {
           if( row[i] == 1) {
            for (int j = 0; j < matrix[0].length;j++) 
                matrix[i][j] = 0;
           }
        } 
         for (int i = 0; i <  matrix[0].length; i++) {
           if( col[i] == 1) {
            for (int j = 0; j < matrix.length;j++) 
                matrix[j][i] = 0;
           }
        } 
    }
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值