初学Java，矩阵相乘，输入两个二维数组时遇到问题，求解答，谢谢！

Question

老师让写两个矩阵相乘，写完后发现，自己一行行地输入数据时，能正常运行。

然而直接通过复制粘贴测试用例输入时，经调试发现程序在接收第二个数组的行数和列数时，没有读到数据，而是停下，等待输入。

自己试了半天无果，想知道是哪里出了问题，希望能得到解答，谢谢！！

测试数据：

2 3

1 2 3

4 5 6

3 2

7 8

9 0

1 2

以下是我的代码：

代码1

import java.util.Scanner;

public class Matrix {
    int matrix[][];
    int row;
    int colunmn;
    Scanner input = new Scanner(System.in);

    Matrix() {
        row = 0;
        colunmn = 0;
    }

    Matrix muti(Matrix m) {
        input.close();
        Matrix result = new Matrix();

        result.row = row;
        result.colunmn = m.colunmn;
        result.matrix = new int[result.row][result.colunmn];

        for (int i = 0; i < result.row; i++) {
            for (int j = 0; j < result.colunmn; j++) {
                for (int k = 0; k < m.row; k++) {
                    result.matrix[i][j] += matrix[i][k] * m.matrix[k][j]; 
                }
            }
        }
        return result;
    }

    int get_row() {
        return row;
    }

    int get_column() {
        return colunmn;
    }

    void set_row_column() {

        row = input.nextInt();
        colunmn = input.nextInt();
    }

    void set_matrix() {

        matrix = new int[row][colunmn];

        for (int i = 0; i < row; i++) {
            for (int j = 0; j < colunmn; j++) {             
                    matrix[i][j] =  input.nextInt();            
            }
        }
    }

    void show_matrix()
    {
        for (int i = 0; i < row; i++) {
            for (int j = 0; j < colunmn; j++) {
                System.out.print(matrix[i][j] + " ");
            }
            System.out.println();
        }
    }
}

代码2：

public class Test {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Matrix m1 = new Matrix();
        Matrix m2 = new Matrix();
        Matrix result = new Matrix();

        m1.set_row_column();
        m1.set_matrix();
        m2.set_row_column();
        m2.set_matrix();
        result = m1.muti(m2);
        result.show_matrix();
    }

}

Answer 1

https://blog.csdn.net/fei201691/article/details/78702839