☆打卡算法☆LeetCode 73、矩阵置零 算法解析

示例 1：
输入： matrix = [[1,1,1],[1,0,1],[1,1,1]]
输出： [[1,0,1],[0,0,0],[1,0,1]]

示例 2：
输入： matrix = [[0,1,2,0],[3,4,5,2],[1,3,1,5]]
输出： [[0,0,0,0],[0,4,5,0],[0,3,1,0]]

public class Solution {
    public void SetZeroes(int[][] matrix) {
        int m = matrix.Length, n = matrix[0].Length;
        // find all zeros first
        List<int[]> zeros = new List<int[]>();
        for (int i = 0; i < m; ++i) {
            for (int j = 0; j < n; ++j) {
                if (matrix[i][j] == 0) zeros.Add(new int[]{i, j});
            }
        }

        // set entire row and col to 0's
        foreach (int[] zero in zeros) {
            int x = zero[0], y = zero[1];
            // row
            for (int i = 0; i < n; ++i) {
                matrix[x][i] = 0;
            }
            // col
            for (int j = 0; j < m; ++j) {
                matrix[j][y] = 0;
            }
        }
    }
}