题解 | #矩阵乘法#
矩阵乘法
https://www.nowcoder.com/practice/ebe941260f8c4210aa8c17e99cbc663b
import java.util.Scanner;
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
int[][] matrix1 = new int[a][b];
int[][] matrix2 = new int[b][c];
for (int i = 0; i < a; i++) {
for (int j = 0; j < b; j++) {
matrix1[i][j] = sc.nextInt();
}
}
for (int i = 0; i < b; i++) {
for (int j = 0; j < c; j++) {
matrix2[i][j] = sc.nextInt();
}
}
int[][] res = new int[a][c];
for (int i = 0; i < a; i++) {
for (int j = 0; j < c; j++) {
int sum = 0;
for (int k = 0; k < b; k++) {
sum += matrix1[i][k] * matrix2[k][j];
}
res[i][j] = sum;
}
}
for (int i = 0; i < a; i++) {
for (int j = 0; j < c; j++) {
System.out.print(res[i][j] + " ");
}
System.out.println();
}
}
}
