傅向华实验课代码大全.docxVIP

线性结构：顺序表——类实现：建立、插入、删除、查找#include iostreamusingnamespacestd;#define ok 0#define error -1classSeqList{public:int*list;intmaxsize;intsize;SeqList();~SeqList();intlist_size();intlist_insert(inti,intitem);intlist_del(inti);intlist_get(inti);voidlist_display();};SeqList::SeqList(){maxsize=1000;size=0;list=newint[maxsize];}SeqList::~SeqList(){delete[]list;}intSeqList::list_insert(inti,intitem){if(i1||isize+1)returnerror;intq,p;q=i;for(p=size;p=q;p--)list[p+1]=list[p];list[q]=item;size++;returnok;}intSeqList::list_del(inti){if(i1||isize)returnerror;intq,p;q;p=size-1;for(q=i;q=p;q++)list[q]=list[q+1];size--;returnok;}intSeqList::list_get(inti){if(i1||isize)returnerror;returnlist[i];}voidSeqList::list_display(){coutsize ;for(inti=1;i=size;i++)coutlist[i] ;coutendl;}intmain(){intn;cinn;SeqList L;inti=1;L.size=n;while(n--){cinL.list[i];i++;}L.list_display();intj,item;cinjitem;if(L.list_insert(j,item)==-1)couterrorendl;elseL.list_display();cinjitem;if(L.list_insert(j,item)==-1)couterrorendl;elseL.list_display();cinj;if(L.list_del(j)==-1)couterrorendl;elseL.list_display();cinj;if(L.list_del(j)==-1)couterrorendl;elseL.list_display();cinj;if(L.list_get(j)==-1)couterrorendl;elsecoutL.list_get(j)endl;cinj;if(L.list_get(j)==-1)couterrorendl;elsecoutL.list_get(j)endl;return0;}合并：#include iostreamusingnamespacestd;#define MAX 1000intmain(){???inta[MAX], b[MAX],c[MAX];????intn1,n2;????cinn1;????inti,j;????for(i=1;i=n1;i++)????cina[i];????cinn2;????for(i=1;i=n2;i++)????????cinb[i];????intk=1;????for(i=1,j=1;i=n1j=n2;k++)????{????????if(a[i]=b[j])????????{????????????c[k]=a[i];????????????i++;????????}????????else????????{????????????c[k]=b[j];????????????j++;????????}????}?????while(i=n1)????{????????c[k]=a[i];????????i++;????????k++;????}????while(j=n2)????{????????c[k]=b[j];????????j++;????????k++;????}????coutk-1 ;????for(i=1;ik;i++)????????coutc[i] ;????coutendl;????return0;}单链表——类实现：#includeiostream? usingnamespacestd;? #define ok 0? #define error -1? ?????classListNode? {? public:?