LeetCode 73. Set Matrix Zeroes C++

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.

Example 1:

Input: 
[
  [1,1,1],
  [1,0,1],
  [1,1,1]
]
Output: 
[
  [1,0,1],
  [0,0,0],
  [1,0,1]
]

Example 2:

Input: 
[
  [0,1,2,0],
  [3,4,5,2],
  [1,3,1,5]
]
Output: 
[
  [0,0,0,0],
  [0,4,5,0],
  [0,3,1,0]
]

Follow up:

  • 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?

Approach

  1. 题目大意是某行某列出现0,则将该行该列都设置为零,题目后面说用尽可能少的空间,看到这道题一般很容易想到对行和列做标记,哪行哪列出现零,则将该行和该列进行标记,我第一次做也是这样,先看代码。

Code

class Solution {
public:
    void setZeroes(vector<vector<int>>& matrix) {
        int high = matrix.size(), len = matrix[0].size();
        vector<bool>row(high, false);
        vector<bool>col(len, false);
        for (int i = 0; i < high; i++) {
            for (int j = 0; j < len; j++) {
                if (matrix[i][j] == 0) {
                    row[i] = true;
                    col[j] = true;
                }
            }
        }
        for (int i = 0; i < high; i++) {
            if (row[i]) {
                for (int j = 0; j < len; j++) {
                    matrix[i][j] = 0;
                }
            }
            else {
                for (int j = 0; j < len; j++) {
                    if (col[j]) {
                        matrix[i][j] = 0;
                    }
                }
            }
        }
    }
};

Again

  1. 我没想出怎么用常量的空间,看了别人的代码,原来是用原来的数组腾出一行和一列用作标记。

Code

class Solution {
public:
    void setZeroes(vector<vector<int>>& matrix) {
        int m = matrix.size(), n = matrix[0].size();
        bool firstrow = false, firstcol = false;
        for (int i = 0; i < m; i++) {
            if (matrix[i][0] == 0) {
                firstcol = true;
                break;
            }
        }
        for (int i = 0; i < n; i++) {
            if (matrix[0][i] == 0) {
                firstrow = true;
                break;
            }
        }
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                if (matrix[i][j] == 0) {
                    matrix[i][0] = 0;
                    matrix[0][j] = 0;
                }
            }
        }
        for (int i = 1; i < m; i++) {
            if (matrix[i][0])continue;
            for (int j = 1; j < n; j++) {
                matrix[i][j] = 0;
            }
        }
        for (int i = 1; i < n; i++) {
            if (matrix[0][i])continue;
            for (int j = 1; j < m; j++) {
                matrix[j][i] = 0;
            }
        }
        if (firstrow) {
            for (int i = 0; i < n; i++) {
                matrix[0][i] = 0;
            }
        }
        if (firstcol) {
            for (int i = 0; i < m; i++) {
                matrix[i][0] = 0;
            }
        }
    }
};
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值