顺序表类与非递减顺序表的合并 参考代码.docxVIP

数据结构之顺序表的类实现#includeiostreamusing namespace std;#include Seq_Table.hSeqTable::SeqTable(int FisrtLen,int Increment){CHUSHULENGTH=FisrtLen;ZENGLIANG=Increment;data=new int[CHUSHULENGTH+1];SeqTableLength=0;SeqTableMemLen=CHUSHULENGTH;}void SeqTable::ListOut(void){if(0==SeqTableLength){cout当前顺序表为空！endl;}else{cout当前顺序表的长度为：SeqTableLengthendl;cout当前顺序表的内容为：;for(int i=1;i=SeqTableLength;i++){coutdata[i],;}coutendl;}}int SeqTable::ListInsert(int pos,int value){if((pos1)||(posSeqTableLength+1))return -1;//内存扩展if(SeqTableLength==SeqTableMemLen){int *temp=new int[SeqTableMemLen+ZENGLIANG+1];for(int i=1;i