[LeetCode 解题报告]073. Set Matrix Zeroes

最新推荐文章于 2021-07-23 19:42:17 发布

caicaiatnbu

最新推荐文章于 2021-07-23 19:42:17 发布

阅读量92

点赞数

分类专栏： LeetCode 解题报告

本文链接：https://blog.csdn.net/caicaiatnbu/article/details/103040905

版权

LeetCode 解题报告专栏收录该内容

154 篇文章 5 订阅

订阅专栏

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?

Method 1. O(mn)

class Solution {
public:
    void setZeroes(vector<vector<int>>& matrix) {
        if (matrix.empty() || matrix[0].empty())
            return ;
        
        bool rowFlag = false, colFlag = false;
        int m = matrix.size(), n = matrix[0].size();
        for (int i = 0; i < m; i ++)
            if (matrix[i][0] == 0)
                colFlag = true;
        
        for (int j = 0; j < n; j ++)
            if (matrix[0][j] == 0)
                rowFlag = true;
        
        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 ++) {
            for (int j = 1; j < n; j ++) {
                if (matrix[i][0] == 0 || matrix[0][j] == 0) {
                    matrix[i][j] = 0;
                }
            }
        }
        
        for (int i = 0; i < m; i ++) {
            if (colFlag)
                matrix[i][0] = 0;
        }
        
        for (int j = 0; j < n; j ++)
            if (rowFlag)
                matrix[0][j] = 0;
    }
};

Method 2. 时间复杂度O(mn)，空间负责度O(m+n)

class Solution {
public:
    void setZeroes(vector<vector<int>>& matrix) {
        if (matrix.empty() || matrix[0].empty())
            return ;
        
        int m = matrix.size(), n = matrix[0].size();
        vector<bool> colFlag(m, false), rowFlag(n, false);
        for (int i = 0; i < m; i ++) {
            for (int j = 0; j < n; j ++) {
                if (matrix[i][j] == 0) {
                    colFlag[i] = true;
                    rowFlag[j] = true;
                }
            }
        }
        
        for (int i = 0; i < m; i ++) {
            for (int j = 0; j < n; j ++) {
                if (colFlag[i] || rowFlag[j])
                    matrix[i][j] = 0;
            }
        }
        
    }
};