用java实现两个矩阵的加减乘法
时间: 2023-05-21 18:00:54 浏览: 61
矩阵加法的Java实现:
```java
public static int[][] matrixAddition(int[][] a, int[][] b) {
int rows = a.length;
int cols = a[0].length;
int[][] result = new int[rows][cols];
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
result[i][j] = a[i][j] + b[i][j];
}
}
return result;
}
```
矩阵减法的Java实现:
```java
public static int[][] matrixSubtraction(int[][] a, int[][] b) {
int rows = a.length;
int cols = a[0].length;
int[][] result = new int[rows][cols];
for (int i = 0; i < rows; i++) {
for (int j = 0; j < cols; j++) {
result[i][j] = a[i][j] - b[i][j];
}
}
return result;
}
```
矩阵乘法的Java实现:
```java
public static int[][] matrixMultiplication(int[][] a, int[][] b) {
int rowsA = a.length;
int colsA = a[0].length;
int colsB = b[0].length;
int[][] result = new int[rowsA][colsB];
for (int i = 0; i < rowsA; i++) {
for (int j = 0; j < colsB; j++) {
for (int k = 0; k < colsA; k++) {
result[i][j] += a[i][k] * b[k][j];
}
}
}
return result;
}
```
以上是Java实现两个矩阵的加减乘法的代码。