【无标题】5.2: 压缩矩阵的转置

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;




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

2,运行结果

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值