這應該是線性數學的矩陣
邏輯思路是:取A矩陣的每壹行的各個項去乘以B矩陣每個列的各個項
為了測試,我現在假設A矩陣是4*3, B矩陣是3*2, 妳要做的乘操作是4*3*2=24次
import?java.util.*;import?java.lang.*;
import?java.io.*;
/*?Name?of?the?class?has?to?be?"Main"?only?if?the?class?is?public.?*/
class?Ideone
{
public?static?void?main?(String[]?args)?throws?java.lang.Exception
{
int[][]A=new?int[][]{{1,2,3},{4,5,6},{7,8,9},{10,11,12}};
int[][]B=new?int[][]{{1,2},{3,4},{5,6}};
int?len_A=A[0].length;//a每行元素數,這裏是3
int?col_A=A.length;//a每列元素數,這裏是4
int?len_B=B[0].length;//b每行元素數,這裏是2
int?col_B=B.length;//b每列元素數,這裏是3
int?len_a=0;
int?col_a=0;
int?len_b=0;
int?col_b=0;
int?sum=0;
while(len_b<len_B)//使B的下壹列被A乘
{
col_a=0;
while(col_a<col_A)//使A可以移動至下壹行
{
len_a=0;
col_b=0;
while(len_a<len_A)//使A的當前行乘以B的當前列
{
sum+=A[col_a][len_a]*B[col_b][len_b];
len_a++;
col_b++;
}
col_a++;
}
len_b++;
}
System.out.println(sum);
}
}