二维数组与压缩矩阵的转置

一.二维数组

1.两种表示方法

typedef struct TwoDArray{
	int rows;
	int lines;
	int **elements;//指向数组的指针，看作指向每一个一维数组的指针（每一行实则就是一个一维数组） 
}TwoDArray,*TwoDArrayPtr;

/*typedef struct TwoDStaticArray{
	int rows;
	int lines;
	int elements[Rows][Lines];//静态分配空间 
}TwoDStaiticArray,*TwoDStaticArrayPtr;*/

2.二维数组的初始化

TwoDArrayPtr InitialADarray(int pararows,int paralines){
	int i;
	TwoDArrayPtr resultPtr=(TwoDArrayPtr)malloc(sizeof(struct TwoDArray));//给这个二维数组先分配空间存储（rows,lines,**elements) 
	resultPtr->rows =pararows;
	resultPtr->lines =paralines;
	resultPtr->elements =(int**)malloc(sizeof(int*)*pararows);//为指向每一行的指针分配空间 
	for(i=0;i<pararows;i++)
	{
		resultPtr->elements[i]=(int*)malloc(sizeof(int)*paralines);//为每一个元素分配空间 
	}
	return resultPtr;
}

3.二维数组的乘法运算

TwoDArrayPtr addelems(TwoDArrayPtr paraPtr1,TwoDArrayPtr paraPtr2)
{
	int i,j,k,sum;
	if(paraPtr1->lines!=paraPtr2->rows)//不能相乘 
	{
		printf("Matrices cannot be multiplied.\r\n");
		return NULL;
	}
	TwoDArrayPtr resultPtr=InitialADarray(paraPtr1->rows ,paraPtr2->lines );
	for(i=0;i<paraPtr1->rows;i++)
	{
		for(j=0;j<paraPtr2->lines;j++)
		{
			sum=0;
			for(k=0;k<paraPtr1->lines;k++)
			{
				sum+=paraPtr1->elements [i][j]*paraPtr2->elements [i][j];
			}
			resultPtr->elements [i][j]=sum;
			printf("sum=%d",sum);
		}
	}
	printf("\n");
	return resultPtr;
}

涉及到三重循环，就是每一行和每一列对应相乘再相加，每循环结束一次就会得到新的二维数组的一项，保存在resultPtr中，最后返回

4.完整代码

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

#define Rows 5
#define Lines 5

typedef struct TwoDArray{
	int rows;
	int lines;
	int **elements;//指向数组的指针，看作指向每一个一维数组的指针（每一行实则就是一个一维数组） 
}TwoDArray,*TwoDArrayPtr;

/*typedef struct TwoDStaticArray{
	int rows;
	int lines;
	int elements[Rows][Lines];//静态分配空间 
}TwoDStaiticArray,*TwoDStaticArrayPtr;*/

TwoDArrayPtr InitialADarray(int pararows,int paralines){
	int i;
	TwoDArrayPtr resultPtr=(TwoDArrayPtr)malloc(sizeof(struct TwoDArray));//给这个二维数组先分配空间存储（rows,lines,**elements) 
	resultPtr->rows =pararows;
	resultPtr->lines =paralines;
	resultPtr->elements =(int**)malloc(sizeof(int*)*pararows);//为指向每一行的指针分配空间 
	for(i=0;i<pararows;i++)
	{
		resultPtr->elements[i]=(int*)malloc(sizeof(int)*paralines);//为每一个元素分配空间 
	}
	return resultPtr;
}

TwoDArrayPtr inputelems(TwoDArrayPtr paraPtr,int pararows,int paralines)
{
	int i,j;
	for(i=0;i<pararows;i++)
	{
		for(j=0;j<paralines;j++)
		{
			scanf("%d",&paraPtr->elements[i][j]);
		}
	}
	return paraPtr;
}

void printelems(TwoDArrayPtr paraPtr)//一行一行的打印 
{
	int i,j;
	for(i=0;i<paraPtr->rows ;i++)
	{
		for(j=0;j<paraPtr->lines ;j++)
		{
			printf("%d ",paraPtr->elements[i][j]);
		}
		printf("\n");
	}
}
TwoDArrayPtr addelems(TwoDArrayPtr paraPtr1,TwoDArrayPtr paraPtr2)
{
	int i,j,k,sum;
	if(paraPtr1->lines!=paraPtr2->rows)//不能相乘 
	{
		printf("Matrices cannot be multiplied.\r\n");
		return NULL;
	}
	TwoDArrayPtr resultPtr=InitialADarray(paraPtr1->rows ,paraPtr2->lines );
	for(i=0;i<paraPtr1->rows;i++)
	{
		for(j=0;j<paraPtr2->lines;j++)
		{
			sum=0;
			for(k=0;k<paraPtr1->lines;k++)
			{
				sum+=paraPtr1->elements [i][j]*paraPtr2->elements [i][j];
			}
			resultPtr->elements [i][j]=sum;
			printf("sum=%d",sum);
		}
	}
	printf("\n");
	return resultPtr;
}

int main()
{
	int pararows1,paralines1;
	scanf("%d%d",&pararows1,&paralines1);
	printf("The row is %d,The line is %d",pararows1,paralines1);
	TwoDArrayPtr paraPtr1,paraPtr2;
	paraPtr1=InitialADarray(pararows1,paralines1);
	paraPtr1=inputelems(paraPtr1,pararows1,paralines1);
	printf("The twoaddary is:\n");
	printelems(paraPtr1);
	
	int pararows2,paralines2;
	scanf("%d%d",&pararows2,&paralines2);
	printf("The row is %d,The line is %d",pararows2,paralines2);
	paraPtr2=InitialADarray(pararows2,paralines2);
	paraPtr2=inputelems(paraPtr2,pararows2,paralines2);
	printf("The twoaddary is:\n");
	printelems(paraPtr2);
	
	TwoDArrayPtr tempPtr=addelems(paraPtr1,paraPtr2);
	printelems(tempPtr);
	return 0;
}

结果展示

说明：分配了三次内存是一个动态分配，最开始为结构体TwoDarray分配了内存，其次为指向每一行数组的指针分配空间，二维数组实则就是一维数组，每一个行每一列都可以看作一维数组，最后再为二维数组中的元素分配空间

 二.压缩矩阵

1.初始化

CompressedMatrixPtr initCompressedMatrix(int paraRows, int paraColumns, int paraElements, int** paraData){
	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(int 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;
} 

2.核心代码

CompressedMatrixPtr transposeCompressedMatrix(CompressedMatrixPtr paraPtr){
	int tempColumn, tempPosition;
	int *tempColumnCounts=(int*)malloc(paraPtr->columns * sizeof(int));
	int *tempOffsets=(int*)malloc(paraPtr->columns * sizeof(int));
	for(int 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(int i=0;i<paraPtr->numElements;i++) {
		tempColumnCounts[paraPtr->elements[i].j]++;
	}
	tempOffsets[0] = 0;
	for(int i=1;i<paraPtr->columns;i++){
		tempOffsets[i] = tempOffsets[i-1] + tempColumnCounts[i-1];
		printf("tempOffsets[%d] = %d \r\n", i, tempOffsets[i]);
	}

	for(int 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;
}

3.完整代码

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


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;
	}//Of for i

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

4.图示说明

 row 2 0 2 0 2//统计转置后每一行的数据个数

       0 2 2 4 4//表示转置后的矩阵每行在压缩矩阵中存储的开始位置