#include <stdio.h>
#include <string.h>
#include<malloc.h>
/*
编写一个实现c=a+b的程序——矩阵的相加
1.先对a个b进行压缩
*/
void main(){
//初始化这个对称矩阵
int a[][3] = { {1,2,3},{2,4,5}, {3,5,6} };
int b[][3]= { {10,20,30},{20,40,50}, {30,50,60} };
int c[3][3];
//这里可以自己输入输出
int length = 6;
//动态申请一下内存
int* aDemo = (int*)(malloc(sizeof(int) * length));
int* bDemo = (int*)(malloc(sizeof(int) * length));
int* cDemo = (int*)(malloc(sizeof(int) * length));
//遍历——实现对字符a的压缩
int k = 0;//用来增加指向内存的位置
for (int row = 0; row < 3; row++) {
for (int col = 0; col < 3; col++) {
if ( k < length&& row <= col) {
aDemo[k] = a[row][col];
k++;
}
}
}
//遍历——实现对字符b的压缩
k = 0;//用来增加指向内存的位置
for (int row = 0; row < 3; row++) {
for (int col = 0; col < 3; col++) {
if (k < length && row <= col) {
bDemo[k] = b[row][col];
k++;
}
}
}
//实现相加
for (int k = 0; k < length; k++)
cDemo[k] = bDemo[k] + aDemo[k];
//把压缩后的矩阵还原
k = 0;//用来增加指向内存的位置
for (int row = 0; row < 3; row++) {
for (int col = 0; col < 3; col++) {
if (k < length && row <= col) {
c[row][col]=cDemo[k];
c[col][row] = cDemo[k];
k++;
}
}
}
//释放内存
free(aDemo);
free(bDemo);
//输出
for (int row = 0; row < 3; row++) {
for (int col = 0; col < 3; col++)
printf("%d ", c[row][col]);
printf("\n");
}
}
简化代码:
#include<stdio.h>
//相加
void Add(int a[],int b[],int c[],int n){
//采用压缩式存储
for(int i=0;i<n*(n+1)/2;i++)
c[i]=a[i]+b[i];
}
//打印
void Print(int a[],int n){
int i,j,k;
for( i=1;i<=n;i++){
for( j=1;j<=n;j++){
if(i>=j)
k=i*(i-1)/2+j-1;
else
k=j*(j-1)/2+i-1;
printf("%d ",a[k]);
}
printf("\n");
}
}
}
void main(){
int a[]={ {1,2,3},{2,4,5}, {3,5,6} };
int b[]= { {10,20,30},{20,40,50}, {30,50,60} };
int c[6];
Add(a,b,c,n);
Print(c,n);
}
//结果是一样的