-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMatrixMultiplication.java
More file actions
43 lines (37 loc) · 1.2 KB
/
MatrixMultiplication.java
File metadata and controls
43 lines (37 loc) · 1.2 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
import java.util.Scanner;
public class MatrixMultiplication {
static void print2DArray(int[][] arr) {
for (int[] i : arr) {
for (int element : i) {
System.out.print(element + "\t");
}
System.out.println();
}
}
static int[][] matrixMultiplication(int[][] a, int[][] b) {
int[][] arr = new int[a.length][b[0].length];
if (a[0].length != b.length) {
arr = null;
return arr;
}
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < b[0].length; j++) {
for (int k = 0; k < b.length; k++) {
arr[i][j] += a[i][k] * b[k][j];
}
}
}
return arr;
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int[][] arr1 = { { 1, 1 }, { 2, 2 }, { 3, 3 } };
int[][] arr2 = { { 1, 1, 1 }, { 2, 2, 2 } };
int[][] arr = matrixMultiplication(arr1, arr2);
if (arr == null) {
System.out.println("Can't multiply these arrays, due to size mismatch");
} else
print2DArray(arr);
scanner.close();
}
}