LeetCode73：矩阵置0

https://leetcode.com/problems/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?

解决方案

https://leetcode-cn.com/problems/set-matrix-zeroes/solution/ju-zhen-zhi-ling-by-leetcode/

Solution

class Solution {
public:
    void setZeroes(vector<vector<int>>& matrix) {
        bool isCol = false;
        for(int r = 0; r < matrix.size(); r++)
        {
            if(matrix[r][0] == 0)
                isCol = true;
            
            for(int c =1; c < matrix[r].size(); c++)
            {            
                if(matrix[r][c] == 0)
                {
                    matrix[r][0]=0;
                    matrix[0][c]=0;
                }
            }            
        }

        
        for(int r = 1; r < matrix.size(); r++)
            for(int c =1; c < matrix[r].size(); c++)
            {
                if(matrix[r][0] == 0 || matrix[0][c] == 0)
                    matrix[r][c] = 0;
            }
        
        if (matrix[0][0] == 0) 
        {
            for (int c = 0; c < matrix[0].size(); c++) 
            {
                matrix[0][c] = 0;
            }
        }
        
        if (isCol) 
        {
            for (int r = 0; r < matrix.size(); r++) 
            {
                matrix[r][0] = 0;
            }
        }
    }
};