java实现矩阵加法减法乘法运算代码
时间: 2023-04-05 22:05:18 浏览: 82
以下是Java实现矩阵加法、减法、乘法的代码:
矩阵加法:
public static int[][] matrixAddition(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[][] matrixSubtraction(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[][] matrixMultiplication(int[][] matrix1, int[][] matrix2) {
int rows1 = matrix1.length;
int columns1 = matrix1[0].length;
int rows2 = matrix2.length;
int columns2 = matrix2[0].length;
if (columns1 != rows2) {
throw new IllegalArgumentException("矩阵无法相乘");
}
int[][] result = new int[rows1][columns2];
for (int i = 0; i < rows1; i++) {
for (int j = 0; j < columns2; j++) {
for (int k = 0; k < columns1; k++) {
result[i][j] += matrix1[i][k] * matrix2[k][j];
}
}
}
return result;
}