题解 | #矩阵乘法#
矩阵乘法
https://www.nowcoder.com/practice/ebe941260f8c4210aa8c17e99cbc663b
import java.util.Scanner;
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int matrix1Line = in.nextInt();
int matrix1Col = in.nextInt();
int matrix2Line = matrix1Col;
int matrix2Col = in.nextInt();
int[][] matrix1 = new int[matrix1Line][matrix1Col];
int[][] matrix2 = new int[matrix2Line][matrix2Col];
for (int i = 0; i < matrix1Line; i++) {
for (int j = 0; j < matrix1Col; j++) {
matrix1[i][j] = in.nextInt();
}
in.nextLine();
}
for (int i = 0; i < matrix2Line; i++) {
for (int j = 0; j < matrix2Col; j++) {
matrix2[i][j] = in.nextInt();
}
in.nextLine();
}
for (int i = 0; i < matrix1Line; i++) {
for (int j = 0; j < matrix2Col; j++) {
int value = 0;
for (int m = 0; m < matrix1Col; m++) {
value += matrix1[i][m] * matrix2[m][j];
}
System.out.printf("%d ", value);
}
System.out.println();
}
}
}
查看19道真题和解析