替换2d数组中的行和列

时间:2015-01-14 23:36:46

标签: java arrays multidimensional-array

我有一个二维数组:

1 0 1 1
1 1 1 1
1 1 1 1
1 1 1 1

我必须编写一个程序来检查数组中是否有0,如果是,那么用0' s替换行和列,所以它看起来像这样:

0 0 0 0
1 0 1 1
1 0 1 1
1 0 1 1

到目前为止,这是我的代码:

public class Run {


    public static void main(String[] args){
        //defining 2d array
        int[][] m = { {1,0,1,1}, 
                      {1,1,1,1},
                      {1,1,1,1},
                      {1,1,1,1}}; 
        int[][] newArray = zero(m);
        //looping through the array to get rows and columns for the array
        //rows
        for (int i = 0; i < m.length; i++) {
            //columns
            for (int j = 0; j < m[0].length; j++) { 
                //check if the integer is the last in the row
                if(j== m.length-1){
                    //print the rows and columns of the array(no space)
                    System.out.print(newArray[i][j]);
                }else{
                    //print the rows and columns of the array(w/ space)
                    System.out.print(newArray[i][j] + " ");
                }
            }
            //new line for the new row
        System.out.println("");
        }
    }

    //checks if there is a zero in the row
    public static int[][] zero(int[][] m) {
        //defining row length and column length
        int rows = m.length;
        int columns = m[0].length;
        int[][] tempArray = m;

        //looping through the array to get rows and columns
        //rows
        for (int i = 0; i < rows; i++) {
            //columns
            for (int j = 0; j < columns; j++) {
                //if the number is 0 loop through that row and column again and change everything to 0 
                if(m[i][j] == 0){
                    //columns in that row
                    for(int l = 0; l < rows; l++)
                    {
                        tempArray[l][j] = 0;
                    }
                    //rows in that column
                    for(int l = 0; l < columns; l++)
                    {
                        tempArray[i][l] = 0;
                    }
                }
            }
        }

        //returning the updated array
        return tempArray;
}

}

当我运行我的代码时,它返回:

0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0

但当我拿出:

    //columns in that row
for(int l = 0; l < rows; l++)
{
    tempArray[l][j] = 0;
}

    //rows in that column
for(int l = 0; l < rows; l++)
{
    tempArray[l][j] = 0;
}

它返回:

0 0 0 0
1 1 1 1
1 1 1 1
1 1 1 1

1 0 1 1
1 0 1 1
1 0 1 1
1 0 1 1

2 个答案:

答案 0 :(得分:2)

问题在于

int[][] tempArray = m;

这会使tempArraym 完全相同的实例,因此您实际上只有一个矩阵。

相反,你应该做

int[][] tempArray = new int[rows][columns];
for (int i = 0; i < rows; i++)
    for (int j = 0; j < columns; j++)
        tempArray[i][j] = m[i][j];

答案 1 :(得分:1)

你在一个循环中检测到0,然后去修改数据并继续你的循环,这现在会看到更多的零,所以设置更多的零。

一旦你发现了0,你应该中断,或者分开检测并重写&#34;重写&#34; - 首先进行所有检测,然后进行所有重写。