数据结构实验二+线性表.doc

实验报告二 线性表班级:   姓名:  学号:    专业:    一、实验目的:(1)理解线性表的逻辑结构、两种存储结构和数据操作;(2)应用顺序表的基本算法实现集合A=AUB算法,应用顺序表的基本算法实现两有序顺序表的归并算法;(3)掌握单链表的遍历、插入和删除等操作算法,实现多项式相加。二、实验内容:1、设有线性表LA=(3,5,8,11)和LB=(2,6,8,9,11,15,20);①若LA和LB分别表示两个集合A和B,求新集合A=AUB(‘并’操作,相同元素不保留);预测输出:LA=(3,5,8,11,2,6,9,15,20)实现代码:packageEx1;lassPoint{inta=0;publicPointnext=null;publicPoint(inta){this(a,null);}publicPoint(inta,Pointnext){=a;=next;}}-----------------------------------packageEx1;lassSeqList{privatePointhead=null;privatePointtail=null;publicSeqList(){head=null;tail=null;}publicbooleanisEmpty(){returnhead==null;}publicvoidaddHead(inta){head=newPoint(a,head);if(tail==null)tail=head;}publicvoidaddTail(inta){if(isEmpty()){(a);}else{Pointtemp=newPoint(a);=temp;tail=;}}publicbooleanFind(inta){if(isEmpty())returnfalse;else{for(Pointtemp=head;temp!=null;temp=){if(==a)returntrue;}}returnfalse;}publicvoidaddList(SeqListlist){for(Pointtemp=;temp!=null;temp=){if(Find()){continue;}else{Pointtemp1=newPoint();=temp1;tail=;}}}publicvoidPri(){//TODOAuto-generatedmethodstubfor(Pointtemp=head;temp!=null;temp=){("%4d",);}}}------------------------packageEx1;lassTest {staticint[]x={3,5,8,11};staticint[]x1={2,6,8,9,11,15,20};staticSeqListList1=newSeqList();staticSeqListList2=newSeqList();publicstaticvoidDef(){for(inti=0;i<;i++){(x[i]);}for(inti=0;i<;i++){(x1[i]);}}publicstaticvoidPri(){("链表内容为:");();("");();("");}publicstaticvoidAdd(){(List2);}publicstaticvoidPri1(){("合并后链表内容为:");();}publicstaticvoidmain(Stringars[]){Def();Pri();Add();Pri1();}}粘贴运行结果:②将LA与LB表归并,要求仍有序(相同元素要保留)(两种存储结构)预测输出:LC=(2,3,5,6,8,8,9,11,11,15,20)packageEx1;lassPoint{inta=0;publicPointnext=null;publicPoint(inta){this(a,null);}publicPoint(inta,Pointnext){=a;