【数组】矩阵的压缩存储

【数组】矩阵的压缩存储

代码

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
#define mm(a) memset(a, 0, sizeof(a))
const int MAXN = 11;
int n, pos;
int matrix[MAXN][MAXN];
int compress[MAXN*MAXN];
void Display(){
    mm(matrix);
    printf("输入方阵\n");
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++)
            scanf("%d", &matrix[i][j]);
    printf("方阵展示\n");
    for (int i = 1; i <= n; i++){
        printf("%d", matrix[i][1]);
        for (int j = 2; j <= n; j++)
            printf(" %d", matrix[i][j]);
        printf("\n");
    }
}
void Compress(){
    pos = 0;
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= n; j++){
            if (i >= j) pos = i*(i-1)/2+j-1;
            else pos = j*(j-1)/2+i-1;
            compress[pos] = matrix[i][j];
        }
    }
    printf("压缩后\n");
    printf("%d", compress[0]);
    for (int k = 1; k <= pos; k++)
        printf(" %d", compress[k]);
    printf("\n");
}
void UncompressVersion1(){
    mm(matrix);
    int i, j;
    for (int k = 0; k <= pos; k++){
        i = ceil(sqrt((k+1)*2+0.25)-0.5);
        j = k-i*(i-1)/2+1;
        matrix[i][j] = matrix[j][i] = compress[k];
    }
    printf("版本1解压缩后\n");
    for (int i = 1; i <= n; i++){
        printf("%d", matrix[i][1]);
        for (int j = 2; j <= n; j++)
            printf(" %d", matrix[i][j]);
        printf("\n");
    }
}
void UNcompressVersion2(){
    mm(matrix);
    int i, j;
    for (int k = 0; k <= pos; k++){
        for (i = 1; i <= n; i++){
            for (j = 1; j <= n; j++){
                if (k == i*(i-1)/2+j-1)
                    matrix[i][j] = matrix[j][i] = compress[k];
            }
        }
    }
    printf("版本2解压缩后\n");
    for (int i = 1; i <= n; i++){
        printf("%d", matrix[i][1]);
        for (int j = 2; j <= n; j++)
            printf(" %d", matrix[i][j]);
        printf("\n");
    }
}
void UncompressVersion3(){
    mm(matrix);
    int i, j;
    for (int k = 0; k <= pos; k++){
        for (i = 1; i <= n; i++)
            if (k < i*(i+1)/2) break;
        j = k-i*(i-1)/2+1;
        matrix[i][j] = matrix[j][i] = compress[k];
    }
    printf("版本3解压缩后\n");
    for (int i = 1; i <= n; i++){
        printf("%d", matrix[i][1]);
        for (int j = 2; j <= n; j++)
            printf(" %d", matrix[i][j]);
        printf("\n");
    }
}
int main(){
    printf("输入方阵的阶数\n");
    scanf("%d", &n);
    Display();
    Compress();
    UncompressVersion1();
    UNcompressVersion2();
    UncompressVersion3();
    return 0;
}