对称矩阵压缩和三种解压缩方式

#include<iostream>
#include<stdio.h>
#include<math.h>
#define SIZE 5
using namespace std;

int* Compress(int *m) {
    int*n = (int*)malloc(sizeof(int)*(SIZE*(SIZE+1)/2));
    int i = 0;
    int j = 0;
    int k = 0;
    for (i = 0; i < SIZE; i++) {
        for (j = 0; j < SIZE; j++, k++) {
            if (i >= j)k = i*(i + 1) / 2 + j;
            else k = j*(j + 1) / 2 + i;
            n[k] = m[i*SIZE+j];
        }
    }
    return n;
}

int* Decompress1(int* n) {
    int * m = (int*)malloc(sizeof(int)*SIZE*SIZE);
    int i = 0;
    int j = 0;
    int k = 0;
    for (i = 0; i < SIZE; i++) {
        for (j = 0; j <= i; j++) {
            if (i >= j)k = i*(i + 1) / 2 + j ;
            else k = j*(j + 1) / 2 + i;
            m[j*SIZE+i] = m[i*SIZE+j] = n[k];
        }
    }
    return (int*)m;
}

int * Decompress2(int* n) {
    int * m = (int*)malloc(sizeof(int)*SIZE*SIZE);
    int i = 0;
    int j = 0;
    int k = 0;
    for (k = 0; k < (SIZE*(SIZE + 1) / 2); k++) {
        for (i = 0; (i + 1)*(i + 2) / 2 < k + 1; i++);
        j = k - i*(i + 1) / 2;
        m[j*SIZE+i] = m[i*SIZE + j] = n[k];
    }
    return m;
}

int * Decompress3(int * n) {
    int * m = (int*)malloc(sizeof(int)*SIZE*SIZE);
    int i = 0;
    int j = 0;
    int k = 0;
    for (k = 0; k < (SIZE)*(SIZE + 1) / 2; k++) {
        i =ceil( sqrt(2*k*1.0 + 2.25) - 1.5);
        j = k - i*(i + 1) / 2;
        m[j*SIZE + i] = m[i*SIZE + j] = n[k];
    }
    return m;
}

int main() {
    int p[SIZE][SIZE] = { 1,5,1,3,7,5,0,8,0,0,1,8,9,2,6,3,0,2,5,1,7,0,6,1,3};
    printf("压缩前:\n");
    for (int i = 0; i < SIZE; i++) {
        for (int j = 0; j < SIZE; j++)
            printf("%d ", p[i][j]);
        printf("\n");
    }
    int* p1 = Compress((int*)p);
    printf("压缩后:\n");
    for (int i = 0; i < (SIZE*(SIZE + 1) / 2); i++)printf("%d ", p1[i]);
    printf("\n");
    printf("解压前:\n");
    for (int i = 0; i < (SIZE*(SIZE + 1) / 2); i++)printf("%d ", p1[i]);
    printf("\n");
    printf("解压后:\n");
    int* p2 = Decompress1((int*)p1);
    for (int i = 0; i < SIZE; i++) {
        for (int j = 0; j < SIZE; j++)
            printf("%d ", p2[i*SIZE+j]);
        printf("\n");
    }
    printf("解压后:\n");
    p2 = Decompress2((int*)p1);
    for (int i = 0; i < SIZE; i++) {
        for (int j = 0; j < SIZE; j++)
            printf("%d ", p2[i*SIZE + j]);
        printf("\n");
    }
    printf("解压后:\n");
    p2 = Decompress3((int*)p1);
    for (int i = 0; i < SIZE; i++) {
        for (int j = 0; j < SIZE; j++)
            printf("%d ", p2[i*SIZE + j]);
        printf("\n");
    }
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值