shunxubiao.zip_链表的合并_顺序表

#include"iostream.h" #include"string.h" template<class T,int MaxSize> class SeqList { T data[MaxSize]; int length; public: SeqList() { length=0; } SeqList(T a[],int n) { if(n>MaxSize) { cerr<<"参数非法"; return; } for(int i=0; i<n; i++) data[i]=a[i]; length=n; } void Combine(SeqList a,SeqList b) { int i=0,j=0,count=0; for(count=0; i<a.length && j<b.length; count++) { if(a.data[i]<b.data[j]) { this->data[count]=a.data[i]; i++; } else { this->data[count]=b.data[j]; j++; } } if(i<a.length) { for(; i<a.length; count++) { this->data[count]=a.data[i]; i++; } } if(j<b.length) { for(; j<b.length; count++) { this->data[count]=b.data[j]; j++; } } this->length=count; } void PrintSeqList() { for(int i=0; i<length; i++) cout<<data[i]<<endl; } }; void main() { int n=18,m=16; int a1[20],a2[20]; for(int i=0; i<n; i++) a1[i]=i*3; for(i=0; i<m; i++) a2[i]=i*2; SeqList<int,40>b1=SeqList<int,40>(a1,n); SeqList<int,40>b2=SeqList<int,40>(a2,m); SeqList<int,40>b3; cout<<"第一个顺序表"<<endl; b1.PrintSeqList(); cout<<"第二个顺序表"<<endl; b2.PrintSeqList(); b3.Combine(b1,b2); cout<<"合并后的顺序表"<<endl; b3.PrintSeqList(); }