如何写Junit测试用例数组矩阵的加法和乘法？

import static org.junit.Assert.*;
import org.junit.Test;

public class MatrixTest {
    
    @Test
    public void testMatrixAddition() {
        // 测试矩阵加法
        int[][] matrix1 = {{1, 2}, {3, 4}};
        int[][] matrix2 = {{5, 6}, {7, 8}};
        
        int[][] expected = {{6, 8}, {10, 12}};
        int[][] result = Matrix.add(matrix1, matrix2);
        
        assertArrayEquals(expected, result);
    }
    
    @Test
    public void testMatrixMultiplication() {
        // 测试矩阵乘法
        int[][] matrix1 = {{1, 2}, {3, 4}};
        int[][] matrix2 = {{5, 6}, {7, 8}};
        
        int[][] expected = {{19, 22}, {43, 50}};
        int[][] result = Matrix.multiply(matrix1, matrix2);
        
        assertArrayEquals(expected, result);
    }
}

public class Matrix {
    
    public static int[][] add(int[][] matrix1, int[][] matrix2) {
        int rows = matrix1.length;
        int columns = matrix1[0].length;
        
        int[][] result = new int[rows][columns];
        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < columns; j++) {
                result[i][j] = matrix1[i][j] + matrix2[i][j];
            }
        }
        
        return result;
    }
    
    public static int[][] multiply(int[][] matrix1, int[][] matrix2) {
        int rows = matrix1.length;
        int columns = matrix2[0].length;
        int common = matrix2.length;
        
        int[][] result = new int[rows][columns];
        for (int i = 0; i < rows; i++) {
            for (int j = 0; j < columns; j++) {
                for (int k = 0; k < common; k++) {
                    result[i][j] += matrix1[i][k] * matrix2[k][j];
                }
            }
        }
        
        return result;
    }
}