数据结构第十周作业（2）——二维数组与矩阵乘法&压缩矩阵的转置

一.二维数组与矩阵乘法

1.代码

#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;
}

2.运行结果

3.图示

3000这个地址储存了rows（行数）、columns（列数），还有一个地址，该地址又指向三个数组，对应三行，每个数组中又有四个数据，对应四列

4.心得体会

①.本处代码使用了双重指针，第一重指针可视为小组组长，而第二重指针可视为各个小组的组员

二.压缩矩阵的转置

1.代码

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

typedef int elem;

typedef struct Triple {
    int i;
    int j;
    int e;
} Triple, *TriplePtr;

typedef struct CompressedMatrix {
    int rows, columns, numElements;
    Triple* elements;
} CompressedMatrix, *CompressedMatrixPtr;

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;
}

void printCompressedMatrix(CompressedMatrixPtr paraPtr) {
	int i;
	for (i = 0; i < paraPtr->numElements; i ++) {
		printf("(%d, %d): %d\r\n", paraPtr->elements[i].i, paraPtr->elements[i].j, paraPtr->elements[i].e);
	}
}


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));
	
	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 \r\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;
}


void compressedMatrixTest() {
	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));
	}//Of for i

	int tempMatrix2[4][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];
		}//of j
	}//of i
	
	tempPtr1 = initCompressedMatrix(2, 3, 4, tempMatrix1);

	printf("After initialization.\r\n");
	printCompressedMatrix(tempPtr1);

	tempPtr2 = transposeCompressedMatrix(tempPtr1);
	printf("After transpose.\r\n");
	printCompressedMatrix(tempPtr2);
}


int main() {
	compressedMatrixTest();

	return 1;
}

2.运行结果

3.图示

4.心得体会

①.如果是行列单纯调换的话，需要重新排序，增加了时间复杂度；

②.此处代码是按行排序，按列扫描原数组的方式实现的。用空间换时间，时间复杂度会降低，效率提升