链串（linkstring）&& 压缩矩阵（compress maxtrix）

#include<stdio.h> #include<malloc.h> #include<iostream> using namespace std; const int SIZE=100; struct linkString{ char data; linkString *next; }; void assign(linkString ** s,char t[]){ int i=0; linkString *q,*ts; *s=(linkString *)malloc(sizeof(linkString)); (*s)->next=NULL; ts=*s; while(t[i]){ q=(linkString *)malloc(sizeof(linkString)); q->data=t[i]; q->next=NULL; ts->next=q; ts=q; ++i; } ts->next=NULL; } void display(linkString *s){ linkString *p=s->next; while(p){ cout<<p->data; p=p->next; } cout<<endl; } int main(){ //cout<<NULL<<endl; char t[SIZE]; cin>>t; linkString* ls=NULL; cout<<ls<<endl; //int ii; //int *pii=&ii; assign(&ls,t); display(ls); } /* 1 2 4 7 2 3 5 8 4 5 6 9 7 8 9 10 */ #include<iostream> using namespace std; const int SIZE=4; const int SIZE2=SIZE*(SIZE+1)/2; int main(){ int arr[SIZE][SIZE],k=0; int b[SIZE*(SIZE+1)/2]; for(int i=0;i<SIZE;++i){ for(int j=0;j<SIZE;++j){ cin>>arr[i][j]; if(i>=j) b[k++]=arr[i][j]; } } //dis cout<<"original:"<<endl; for(int i=0;i<SIZE;++i){ for(int j=0;j<SIZE;++j) cout<<arr[i][j]<<" "; cout<<endl; } cout<<"compress:"<<endl; for(int i=0;i<SIZE2;++i) cout<<b[i]; cout<<endl; cout<<"________________________"<<endl; for(int i=0;i<SIZE;++i){ for(int j=0;j<SIZE;++j){ if(i>=j) cout<<b[i*(i+1)/2+j]<<" "; else cout<<b[j*(j+1)/2+i]<<" "; } cout<<endl; } cout<<"Input col & row:"<<endl; int col,row; cin>>row>>col; cout<<"In the original array:"<<endl; cout<<arr[row][col]<<endl; cout<<"In the array for symmetry matrix:"<<endl; if(row>=col) cout<<b[row*(row+1)/2+col]<<endl; else cout<<b[col*(col+1)/2+row]<<endl; }