第2章数据结构-线性表(天津大学)概要.ppt

AH.first BH.first ? ? CH.first ? 1 0 1 0 -1 4 -1 4 -3 6 3 6 -9 10 7 12 7 12 8 14 8 14 pa p pc -9 10 pb AH.first ? ? CH.first ? 1 0 1 0 -1 4 -1 4 -3 6 3 6 -9 10 7 12 7 12 8 14 8 14 pa pb pc -9 10 AH.first ? ? CH.first ? 1 0 1 0 -1 4 -1 4 -3 6 3 6 -9 10 7 12 7 12 8 14 8 14 pa pb pc -9 10 AH.first ? ? CH.first ? 1 0 1 0 -1 4 -1 4 -3 6 3 6 -9 10 7 12 7 12 8 14 8 14 pa p pc -9 10 pb 0 AH.first ? ? CH.first ? 1 0 1 0 -1 4 -1 4 0 6 -9 10 7 12 7 12 8 14 8 14 pa p pc -9 10 pb AH.first ? ? CH.first ? 1 0 1 0 -1 4 -1 4 -9 10 7 12 7 12 8 14 8 14 pa pc -9 10 pb AH.first ? ? CH.first ? 1 0 1 0 -1 4 -1 4 -9 10 7 12 7 12 8 14 8 14 pa pc -9 10 pb AH.first ? ? CH.first ? 1 0 1 0 -1 4 -1 4 -9 10 7 12 7 12 8 14 8 14 pa == pc -9 10 pb ? AH.first ? CH.first ? 1 0 1 0 -1 4 -1 4 -9 10 7 12 7 12 8 14 8 14 pa == pc -9 10 pb ? C算法描述 void AddPloyn ( Polynomial Pa, Polynomial Pb ) { //多项式Pa= Pa+Pb， ha = GetHead(Pa); hb = GetHead(Pb); //ha和hb分别指向Pa和Pb的头结点 qa = NextPos(Pa,ha); qb = NextPos(Pb,hb); //qa和qb分别指向Pa和Pb的当前结点 while(qa qb)｛ //qa和qb均非空 a=GetCurElem(qa); b=GetCurElem(qb); //a和b为两表中当前比较元素 switch(*cmp(a,b)){ case -1: //多项式Pa中当前结点的指数值小 ha = qa; qa = NextPos(Pa,qa); break; case 0 : //两者的指数相等 sum = a.coef + b.coef; if(sum!=0.0){ //修改多项式Pa中当前结点的系数值 SetCurElem(qa.sum); ha = qa; } else { //删除多项式PA中当前结点 DelFirst(hb,qa); FreeNode(qa); } DelFirst(hb,qb); FreeNode(qb); qb=NextPos(Pb,hb);qa=NextPos(Pa,ha);break; case1 : //多项式PB中当前结点的指数值小 DelFirst(hb,qb); InsFirst(ha,qb); qb = NextPos(Pb,hb); }//switch }//while if ( !ListEmpty(Pb))Append(Pa,qb); //链接Pb中剩余结点 FreeNode(hb); //释放Pb的头结点 } //AddPolyn C++算法描述 Polynomial operator + ( Polynomial ah, Polynomial bh ) { //两个带头结点的按升幂排列的多项式相加， //返回结果多项式链表的表头指针，结果不 //另外占用存储, 覆盖ah和bh链表 ListNodeTerm *pa, *pb, *pc, *p; Term a, b; pa=pc = ah.poly.First ( ); //结果存放指针 pb=p = bh.poly.First