写一段java实现矩阵运算

以下是一个简单的Java程序，用于实现矩阵运算。程序包括创建矩阵、矩阵加法、矩阵乘法等功能。

public class MatrixOperation {
    public static void main(String[] args) {
        // 创建两个矩阵
        int[][] matrix1 = {{1, 2}, {3, 4}};
        int[][] matrix2 = {{5, 6}, {7, 8}};
        
        // 输出矩阵1
        System.out.println("Matrix 1:");
        printMatrix(matrix1);
        
        // 输出矩阵2
        System.out.println("Matrix 2:");
        printMatrix(matrix2);
        
        // 矩阵加法
        int[][] sum = addMatrix(matrix1, matrix2);
        System.out.println("Matrix 1 + Matrix 2:");
        printMatrix(sum);
        
        // 矩阵乘法
        int[][] product = multiplyMatrix(matrix1, matrix2);
        System.out.println("Matrix 1 * Matrix 2:");
        printMatrix(product);
    }
    
    // 打印矩阵
    public static void printMatrix(int[][] matrix) {
        for (int i = 0; i < matrix.length; i++) {
            for (int j = 0; j < matrix[i].length; j++) {
                System.out.print(matrix[i][j] + " ");
            }
            System.out.println();
        }
        System.out.println();
    }
    
    // 矩阵加法
    public static int[][] addMatrix(int[][] matrix1, int[][] matrix2) {
        int[][] sum = new int[matrix1.length][matrix1[0].length];
        for (int i = 0; i < matrix1.length; i++) {
            for (int j = 0; j < matrix1[i].length; j++) {
                sum[i][j] = matrix1[i][j] + matrix2[i][j];
            }
        }
        return sum;
    }
    
    // 矩阵乘法
    public static int[][] multiplyMatrix(int[][] matrix1, int[][] matrix2) {
        int[][] product = new int[matrix1.length][matrix2[0].length];
        for (int i = 0; i < matrix1.length; i++) {
            for (int j = 0; j < matrix2[0].length; j++) {
                for (int k = 0; k < matrix1[0].length; k++) {
                    product[i][j] += matrix1[i][k] * matrix2[k][j];
                }
            }
        }
        return product;
    }
}

以上程序将输出以下内容：

Matrix 1:
1 2 
3 4 

Matrix 2:
5 6 
7 8 

Matrix 1 + Matrix 2:
6 8 
10 12 

Matrix 1 * Matrix 2:
19 22 
43 50