數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)代碼1.doc

數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)參考代碼實(shí)驗(yàn)一：針對(duì)鏈?zhǔn)交蝽樞虼鎯?chǔ)的線(xiàn)性表實(shí)現(xiàn)指定的操作題1 問(wèn)題描述：有兩個(gè)指數(shù)遞減的一元多項(xiàng)式，寫(xiě)一程序先求這兩個(gè)多項(xiàng)式的和，再求它們的積?；疽螅河脦П眍^結(jié)點(diǎn)的單鏈表作為多項(xiàng)式的存儲(chǔ)表示；要建立兩個(gè)單鏈表；多項(xiàng)式相加就是要把一個(gè)單鏈表中的結(jié)點(diǎn)插入到另一個(gè)單鏈表中去，要注意插入、刪除操作中指針的正確修改。題2 問(wèn)題描述：編號(hào)為1，2，n的n個(gè)人圍坐在一圓桌旁，每人持有一個(gè)正整數(shù)的密碼。從第一個(gè)人開(kāi)始報(bào)數(shù)，報(bào)到一個(gè)預(yù)先約定的正整數(shù)m時(shí)，停止報(bào)數(shù)，報(bào)m的人退席，下一個(gè)人又重新從1開(kāi)始報(bào)數(shù)，依此重復(fù)，直至所有的人都退席。編一程序輸出他們退席的編號(hào)序列。例如，設(shè)m=20，n=7，7個(gè)人的密碼依次是3，1，7，2，4，8，4，則退席的人的編號(hào)依次為6，1，4，7，2，3，5。基本要求：用不帶表頭結(jié)點(diǎn)的循環(huán)單鏈表表示圍成圓圈的n個(gè)人；要求建立此循環(huán)單鏈表；某人離席相當(dāng)于刪除一個(gè)結(jié)點(diǎn)，要正確設(shè)置程序中循環(huán)終止的條件和刪除結(jié)點(diǎn)時(shí)指針的修改變化。/實(shí)驗(yàn)1.1代碼#includeusing namespace std;struct poNodefloat coef;int expn;poNode *next;class Polynomailpublic:Polynomail(int m=0); Polynomail();int Print();int PolynLength();Polynomail &AddPolyn(Polynomail &P2,Polynomail &P3);Polynomail &MultiplyPolyn(Polynomail &P2,Polynomail &P4);private:int InsertpoNode();poNode *first;int main()int m;cout輸入多項(xiàng)式P1項(xiàng)數(shù)m;Polynomail P1(m);if(P1.PolynLength()!=m)couterror!endl;return -1;cout輸入多項(xiàng)式P2項(xiàng)數(shù)m;Polynomail P2(m);if(P2.PolynLength()!=m)couterror!endl;return -1;cout多項(xiàng)式P1:;P1.Print();cout多項(xiàng)式P2:;P2.Print();Polynomail P3;P3=P1.AddPolyn(P2,P3);coutP1+P2:;P3.Print();Polynomail P4;P4=P1.MultiplyPolyn(P2,P4);coutP1*P2:;P4.Print();return 0;int Polynomail:InsertpoNode()if(first=NULL)first=new poNode;cout輸入系數(shù)和指數(shù)：first-coef;cinfirst-expn;first-next=NULL;elsepoNode *p=new poNode;poNode *q=first;cout輸入系數(shù)和指數(shù)：p-coef;cinp-expn;poNode *r;while(q-next!=NULL&q-expnexpn)r=q;q=q-next;if(q=first&q-next!=NULL) if(q-expn=p-expn) return -1;p-next=q;first=p;else if(q=first&q-next=NULL)if(p-expnexpn)p-next=q;first=p;else if(p-expnq-expn)q-next=p;p-next=NULL;else return -1;else if(q-next=NULL&q!=first&p-expnq-expn)q-next=p;p-next=NULL;elseif(q-expn=p-expn)return -1;r-next=p;p-next=q;return 0;Polynomail:Polynomail(int m)first=NULL;int i;for(i=0;im;i+)int r=InsertpoNode();if(r=-1) break;int Polynomail:Print()poNode *p=first;coutf(x)=;if(first=NULL) coutNULLendl;while(p!=NULL)coutcoef*xexpn;if(p-next=NULL) coutendl;else coutnext;return 0;Polynomail:Polynomail()poNode *p=first;while(p!=NULL)p=p-next;delete first;first=p;int Polynomail:PolynLength()int i=0;poNode *p=first;while(p!=NULL)p=p-next;i+;return i;Polynomail &Polynomail:AddPolyn(Polynomail &P2,Polynomail &P3)poNode *p=first;poNode *q=P2.first;P3.first=new poNode;poNode *r=P3.first;while(p!=NULL&q!=NULL)if(p-expn=q-expn) r-coef=p-coef+q-coef;r-expn=p-expn;p=p-next;q=q-next;else if(p-expnexpn)r-coef=p-coef;r-expn=p-expn;p=p-next;elser-coef=q-coef;r-expn=q-expn;q=q-next;if(p!=NULL|q!=NULL)r-next=new poNode;r=r-next;else r-next=NULL;while(p!=NULL|q!=NULL)if(p!=NULL)r-coef=p-coef;r-expn=p-expn;p=p-next;elser-coef=q-coef;r-expn=q-expn;q=q-next;if(p!=NULL|q!=NULL)r-next=new poNode;r=r-next;else r-next=NULL;return P3;Polynomail &Polynomail:MultiplyPolyn(Polynomail &P2,Polynomail &P4)poNode *p=first;while(p!=NULL)Polynomail P3;poNode *q=P2.first;P3.first=new poNode;poNode *r=P3.first;r-coef=p-coef*q-coef;r-expn=p-expn+q-expn;q=q-next;while(q!=NULL)r-next=new poNode;r=r-next;r-coef=p-coef*q-coef;r-expn=p-expn+q-expn;q=q-next;r-next=NULL;P4=P4.AddPolyn(P3,P4);p=p-next;return P4;/實(shí)驗(yàn)1.2代碼#includeusing namespace std;struct numNodeint key;int num;numNode *next;int CreatCircleList(numNode *now,int length);int Loop(numNode *now,int m);int main()int m;int n;numNode *now=new numNode;cout請(qǐng)輸入人數(shù)：n;cout請(qǐng)輸入初始數(shù)m:m;CreatCircleList(now,n);Loop(now,m);return 0;int CreatCircleList(numNode *now,int length)if(length=0)couterror!num=1;cout請(qǐng)輸入編號(hào)為1的人擁有的密碼。now-key;numNode *p=now;int i;for(i=1;inext=new numNode;p=p-next;p-num=i+1;cout請(qǐng)輸入編號(hào)為i+1的人擁有的密碼。p-key;p-next=now;ret