二维数组与矩阵乘法

矩阵相乘最重要的方法是一般矩阵乘积。它只有在第一个矩阵的列数（column）和第二个矩阵的行数（row）相同时才有意义

A矩阵和B矩阵可以做乘法运算必须满足A矩阵的列的数量等于B矩阵的行的数量

运算规则：A的每一行中的数字对应乘以B的每一列的数字把结果相加起来

构建矩阵

typedef struct TwowArray{
	int rows;
	int columns;
	int** elements;
} TwowArray, *TwowArrayPtr;
 
/**
 * Two dimensional array.
 */
typedef struct TwowStaticArray{
	int rows;
	int columns;
	int elements[ROWS][COLUMNS];
} TwowStaticArray, *TwowStaticArrayPtr;

矩阵初始化

TwowArrayPtr initTwowArray(int paraRows, int paraColumns){
	int i;
	
	TwowArrayPtr resultPtr = (TwowArrayPtr)malloc(sizeof(struct TwowArray));
	resultPtr->rows = paraRows;
	resultPtr->columns = paraColumns;
	resultPtr->elements = (int**)malloc(paraRows * sizeof(int*));
	
	for (i = 0; i < paraRows; i ++)
	{
		resultPtr->elements[i] = (int*)malloc(paraColumns * sizeof(int));
	}//Of for i
 
	return resultPtr;
}

给矩阵分配元素

void randomTwowArray(TwowArrayPtr paraPtr, int paraLowerBound, int paraUpperBound){
	int i, j;	
	for (i = 0; i < paraPtr->rows; i ++)
	{
		for (j = 0; j < paraPtr->columns; j ++)
		{
			paraPtr->elements[i][j] = rand() % (paraUpperBound - paraLowerBound) + paraLowerBound;
		}//Of for j
	}//Of for i
}

输出打印

void printTwowArray(TwowArrayPtr paraPtr){
	int i, j;	
	for (i = 0; i < paraPtr->rows; i ++)
	{
		for (j = 0; j < paraPtr->columns; j ++) 
		{
			printf("%d,  ", paraPtr->elements[i][j]);
		}//Of for j
		printf("\r\n");
	}//Of for i
}

乘积操作

TwowArrayPtr Multiply(TwowArrayPtr paraPtr1, TwowArrayPtr paraPtr2){
	int i, j, k, sum;
	
	if (paraPtr1->columns != paraPtr2->rows)
	{
		printf("Matrices cannot multiplied.\r\n");
		return NULL;
	}
 
	TwowArrayPtr resultPtr = initTwowArray(paraPtr1->rows, paraPtr2->columns);
 
	for (i = 0; i < paraPtr1->rows; i ++)
	{
		for (j = 0; j < paraPtr2->columns; j ++) 
		{
			sum = 0;
			for (k = 0; k < paraPtr1->columns; k ++) 
			{
				sum += paraPtr1->elements[i][k] * paraPtr2->elements[k][j];
			}
			resultPtr->elements[i][j] = sum;
			printf("sum = %d, ", sum);
		}
	}
 
	return resultPtr;
}