矩陣相乘

package 演算法;

import java.util.Scanner;

public class 矩陣相乘 {

    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);

        int[][] m1 = {
                {1, 2},
                {1, -1}
        };
        int[][] m2 = {
                {1, 2, -3},
                {-1, 1, 2}
        };
        //取第一個矩陣的行
        int r=m1.length;
        //取第一個矩陣的列
        int p =m1[0].length;
        int c=m2[0].length;
        int [][] arr=new int[r][c];
        for (int i = 0; i <r ; i++) {
            for (int j = 0; j <c ; j++) {
                for (int k = 0; k <p ; k++) {
                    arr[i][j]+=m1[i][k]*m2[k][j];
                }
            }
        }
        for (int[] ints : arr) {
            for (int i : ints) {
                System.out.print(i+" ");
            }
            System.out.println();
        }
    }
}