LeetCode 73矩阵置零(java)

class Solution {
    public void setZeroes(int[][] matrix) {
        int m = matrix.length, n = matrix[0].length;
        
        int [][] temp = new int [m][n];
        
        for(int i = 0; i < m; ++i) 
            for(int j = 0; j < n; ++j) 
                temp[i][j] = matrix[i][j];
        
        for(int i = 0; i < m; ++i) 
            for(int j = 0; j < n; ++j) 
                if(temp[i][j] == 0) 
                    help(matrix, i, j);
        
    }
    public void help(int [][] matrix, int p , int q) {
        for(int j = 0; j < matrix[0].length; ++j) 
            matrix[p][j] = 0;
        for(int i = 0; i < matrix.length; ++i) 
            matrix[i][q] = 0;
    }
}