矩阵乘法&压缩矩阵的转置

目录

 矩阵乘法：

压缩矩阵的转置：

---

 

 矩阵乘法：

1、定义三个二维数组来存储第一个矩阵、第二个矩阵和相乘后得到的新矩阵。
2、对第一个、第二个矩阵的每个进行赋值（要注意的是我们需要让第一个矩阵的列数等于第二个矩阵的行数），然后将其打印出来。
3、使用for循环语句，先遍历第二个矩阵的第j列的每一个元素，然后将其与第一个元素的第i列的每一个元素进行相乘并相加。将其运算后的结果放在对应第i行第j列的新数组中。
4、再利用for循环将得到的新数组进行一个元素一个元素的输出。
 

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

#define ROWS 4
#define COLUMNS 5


typedef struct TwoDArray{
	int rows;
	int columns;
	int** elements;
} TwoDArray, *TwoDArrayPtr;


 
typedef struct TwoDStaticArray{
	int rows;
	int columns;
	int elements[ROWS][COLUMNS];
} TwoDStaticArray, *TwoDStaticArrayPtr;


TwoDArrayPtr initTwoDArray(int paraRows, int paraColumns){
	int i;
	TwoDArrayPtr resultPtr = (TwoDArrayPtr)malloc(sizeof(struct TwoDArray));
	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 randomizeTwoDArray(TwoDArrayPtr 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 printTwoDArray(TwoDArrayPtr 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");
	}
}
TwoDArrayPtr matrixMultiply(TwoDArrayPtr paraPtr1, TwoDArrayPtr paraPtr2){
	int i, j, k, sum;
	if (paraPtr1->columns != paraPtr2->rows){
		printf("Matrices cannot be multiplied.\r\n");
		return NULL;
	}

	TwoDArrayPtr resultPtr = initTwoDArray(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 twoDArrayTest(){
	TwoDArrayPtr tempPtr1, tempPtr2, tempPtr3;
	tempPtr1 = initTwoDArray(3, 2);
	randomizeTwoDArray(tempPtr1, 1, 5);
	printf("The first matrix:\r\n");
	printTwoDArray(tempPtr1);

	tempPtr2 = initTwoDArray(2, 4);
	randomizeTwoDArray(tempPtr2, 4, 9);
	printf("The second matrix:\r\n");
	printTwoDArray(tempPtr2);

	tempPtr3 = matrixMultiply(tempPtr1, tempPtr2);
	printf("The result:\r\n");
	printTwoDArray(tempPtr3);
}
TwoDStaticArrayPtr initTwoDStaticArray(){
	int i, j;
	TwoDStaticArrayPtr resultPtr = (TwoDStaticArrayPtr)malloc(sizeof(struct TwoDStaticArray));
	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(){
	twoDArrayTest();
	TwoDStaticArrayPtr tempPtr = initTwoDStaticArray();

	return 1;
}

运行结果：

The first matrix:
2, 4,
3, 1,
2, 1,
The second matrix:
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): 2037160; (0, 1): 2037164; (0, 2): 2037168; (0, 3): 2037172; (0, 4): 2037176; (1, 0): 2037180; (1, 1): 2037184; (1, 2): 2037188; (1, 3): 2037192; (1, 4): 2037196; (2, 0): 2037200; (2, 1): 2037204; (2, 2): 2037208; (2, 3): 2037212; (2, 4): 2037216; (3, 0): 2037220; (3, 1): 2037224; (3, 2): 2037228; (3, 3): 2037232; (3, 4): 2037236;
--------------------------------
Process exited after 0.04081 seconds with return value 1
请按任意键继续. . .

压缩矩阵的转置：

#include <stdio.h>
#include <malloc.h>
 
typedef int elem;
/**
 * 行索引、列索引和数据的三元组。
 */
typedef struct Triple {
	int i;
	int j;
	elem e;
} Triple, *TriplePtr;
 
/**
 * 行索引、列索引和数据的三元组。
 */
typedef struct CompressedMatrix {
	int rows, columns, numElements;
	Triple* elements;
} CompressedMatrix, *CompressedMatrixPtr;
 
/**
 * @brief 初始化一个压缩矩阵。
 *
 * @param paraColumns
 * @param paraData
 * @param paraElements
 * @param paraRows
 *
 * @return
 */
CompressedMatrixPtr initCompressedMatrix(int paraRows, int paraColumns, int paraElements, int** paraData) {
	int i;
	//申请一个矩阵
	CompressedMatrixPtr resultPtr = (CompressedMatrixPtr)malloc(sizeof(struct CompressedMatrix));
	resultPtr->rows = paraRows;
	resultPtr->columns = paraColumns;
	resultPtr->numElements = paraElements;
	//申请矩阵的存储库
	resultPtr->elements = (TriplePtr)malloc(paraElements * sizeof(struct Triple));
	//把二维数组的值存入矩阵存储库中
	for (i = 0; i < paraElements; i ++) {
		resultPtr->elements[i].i = paraData[i][0];
		resultPtr->elements[i].j = paraData[i][1];
		resultPtr->elements[i].e = paraData[i][2];
	}
 
	return resultPtr;
}
 
/**
 * @brief 打印矩阵
 *
 * @param paraPtr
 */
void printCompressedMatrix(CompressedMatrixPtr paraPtr) {
	int i;
	for (i = 0; i < paraPtr->numElements; i ++) {
		printf("(%d, %d): %d\n", paraPtr->elements[i].i, paraPtr->elements[i].j, paraPtr->elements[i].e);
	}
}
 
/**
 * @brief 转置一个压缩矩阵。
 *
 * @param paraPtr
 *
 * @return
 */
CompressedMatrixPtr transposeCompressedMatrix(CompressedMatrixPtr paraPtr) {
	
	//第一步，分配空间。
	int i, tempColumn, tempPosition;
	int *tempColumnCounts = (int*)malloc(paraPtr->columns * sizeof(int));
	int *tempOffsets = (int*)malloc(paraPtr->columns * sizeof(int));
	for (i = 0; i < paraPtr->columns; i ++) {
		tempColumnCounts[i] = 0;
	}
 
	CompressedMatrixPtr resultPtr = (CompressedMatrixPtr)malloc(sizeof(struct CompressedMatrix));
	resultPtr->rows = paraPtr->columns;
	resultPtr->columns = paraPtr->rows;
	resultPtr->numElements = paraPtr->numElements;
 
	resultPtr->elements = (TriplePtr)malloc(paraPtr->numElements * sizeof(struct Triple));
 
	//第2步，一次扫描以计算转置后的值。
	printf("需要转置，定义tempOffsets[]存储需要转置的值\n");
	for (i = 0; i < paraPtr->numElements; i ++) {
		tempColumnCounts[paraPtr->elements[i].j] ++;
	}
	tempOffsets[0] = 0;
	for (i = 1; i < paraPtr->columns; i ++) {
		tempOffsets[i] = tempOffsets[i - 1] + tempColumnCounts[i - 1];
		printf("tempOffsets[%d] = %d \n", i, tempOffsets[i]);
	}
 
	//第三步，再次扫描填充数据。
	for (i = 0; i < paraPtr->numElements; i ++) {
		tempColumn = paraPtr->elements[i].j;
		tempPosition = tempOffsets[tempColumn];
		resultPtr->elements[tempPosition].i = paraPtr->elements[i].j;
		resultPtr->elements[tempPosition].j = paraPtr->elements[i].i;
		resultPtr->elements[tempPosition].e = paraPtr->elements[i].e;
 
		tempOffsets[tempColumn]++;
	}
 
	return resultPtr;
}
 
/**
 * @brief 测试压缩矩阵。
 */
void compressedMatrixTest() {
	printf("---- transposeCompressedMatrix 测试开始 ----\n");
	CompressedMatrixPtr tempPtr1, tempPtr2;
	int i, j, tempElements;
 
	//构造第一个样本矩阵。
	tempElements = 4;
	int** tempMatrix1 = (int**)malloc(tempElements * sizeof(int*));
	for (i = 0; i < tempElements; i ++) {
		tempMatrix1[i] = (int*)malloc(3 * sizeof(int));
	}
 
	int tempMatrix2[5][3] = {{0, 0, 2}, {0, 2, 3}, {2, 0, 5}, {2, 1, 6}};
	for (i = 0; i < tempElements; i ++) {
		for (j = 0; j < 3; j ++) {
			tempMatrix1[i][j] = tempMatrix2[i][j];
		}
	}
 
	tempPtr1 = initCompressedMatrix(2, 3, 4, tempMatrix1);
 
	printf("初始化后：\n");
	printCompressedMatrix(tempPtr1);
 
	tempPtr2 = transposeCompressedMatrix(tempPtr1);
	printf("转置后：\n");
	printCompressedMatrix(tempPtr2);
	printf("---- transposeCompressedMatrix 测试结束 ----\n");
}
 
int main() {
	compressedMatrixTest();
	return 1;
}

运行结果：

---- transposeCompressedMatrix 测试开始 ----
初始化后：
(0, 0): 2
(0, 2): 3
(2, 0): 5
(2, 1): 6
需要转置，定义tempOffsets[]存储需要转置的值
tempOffsets[1] = 2
tempOffsets[2] = 3
转置后：
(0, 0): 2
(0, 2): 5
(1, 2): 6
(2, 0): 3
---- transposeCompressedMatrix 测试结束 ----

--------------------------------
Process exited after 0.0382 seconds with return value 1
请按任意键继续. . .