数据结构 二位数组与矩阵乘法

1.定义：令A为m*k矩阵，B为k*n矩阵。A和B的乘积，记作AB，是一个m*n矩阵，其弟（i，j）元素等于A的第i行与B的第j列对应元素的乘积之和。换言之，如果AB=[Cij],则

             Cij = ai1bi1+ai2b2i+...+aikbkj

 *注意：AB不等于BA的！！！

2.矩阵代码

#include<stdio.h>
#include<malloc.h>
#include<stdlib.h>

#define ROWS 4
#define COLUMNS 5

typedef struct TwoArray {
	int rows;
	int columns;
	int** elements;
}TwoArray,*TwoArrayPtr;

typedef struct TwoStaticArray {
	int rows;
	int columns;
	int elements[ROWS][COLUMNS];
}TwoStaticArray,*TwoStaticArrayPtr;

TwoArrayPtr initTwoArray(int paraRows, int paraColumns) {
	int i;
	TwoArrayPtr resultPtr = (TwoArrayPtr)malloc(sizeof(struct TwoArray));
	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));
	}
	return resultPtr;
}  

void randomizeTwoArray(TwoArrayPtr 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;
		}
	}
}

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

TwoArrayPtr matrixMultiply(TwoArrayPtr paraPtr1, TwoArrayPtr paraPtr2) {
	int i,j,k,sum;
	if (paraPtr1->columns != paraPtr2->rows) {
		printf("Matrices cannot be multiplied\n");
		return NULL;
	}
	
	TwoArrayPtr resultPtr = initTwoArray(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;
}

void twoArrayTest() {
	TwoArrayPtr tempPtr1, tempPtr2, tempPtr3;
	tempPtr1 = initTwoArray(3,2);
	randomizeTwoArray(tempPtr1,1,5);
	printf("The first matrix:\n");
	
	printTwoArray(tempPtr1);
	
	tempPtr2 = initTwoArray(2,4);
	randomizeTwoArray(tempPtr2,4,9);
	printf("The second matirix:\n");
	
	printTwoArray(tempPtr2); 
	
	tempPtr3 = matrixMultiply(tempPtr1,tempPtr2);
	printf("The result:\n");
	printTwoArray(tempPtr3); 
}

TwoStaticArrayPtr initTwoStaticArray() {
	int i,j;
TwoStaticArrayPtr resultPtr = (TwoStaticArrayPtr)malloc(sizeof(struct TwoStaticArray));
   resultPtr->rows = ROWS;
   resultPtr->columns = COLUMNS;
   for (i = 0; i < ROWS; i++) {
   	for (j = 0; j < COLUMNS; j++) {
   		resultPtr->elements[i][j] = i * 10 + j;
   		
   		printf("(%d,%d): %d",i,j,&(resultPtr->elements[i][j]));
	   }
   }
   return resultPtr;
}

int main(){
	twoArrayTest();
	TwoStaticArrayPtr tempPtr = initTwoStaticArray();
	
	return 1; 
} 

3.运行结果

The first matrix:
2, 4,
3, 1,
2, 1,
The second matirix:
7, 7, 6, 8,
4, 4, 5, 6,
sum = 30, sum = 30, sum = 32, sum = 40, sum = 25, sum = 25, sum = 23, sum = 30, sum = 18, sum = 18, sum = 17, sum = 22, The result:
30, 30, 32, 40,
25, 25, 23, 30,
18, 18, 17, 22,
(0,0): 11365848(0,1): 11365852(0,2): 11365856(0,3): 11365860(0,4): 11365864(1,0): 11365868(1,1): 11365872(1,2): 11365876(1,3): 11365880(1,4): 11365884(2,0): 11365888(2,1): 11365892(2,2): 11365896(2,3): 11365900(2,4): 11365904(3,0): 11365908(3,1): 11365912(3,2): 11365916(3,3): 11365920(3,4): 11365924