一元多项式的加法(3)

数据结构第二次实验报告

}

} else{ }

return pHead;

while(fence->next != NULL&&t1->no <= fence->next->no){ }

t1->next = fence->next ; fence->next = t1; fence=fence->next ;

Node* sNode::Insert(){ }

void sNode::setPloy(){

Node* pNext = new Node(); pNext->next = NULL;

cin>>pNext->vol >>pNext->no ; size++;

return Remove(pNext);

数据结构第二次实验报告

}

cout<<\输入多项式的项数\int number; cin>>number;

cout<<\输入多项式的各项（系数在前 幂次在后）\setpHead();

for(int i=0;i

pHead = Insert();

void sNode::Print(double m,double n){ if(m>0) }

void sNode::PrintInfo(){

cout<<\输入的多项式是\Node* t1 = pHead; int m = size; while(m>0){

Print(t1->vol,t1->no);

cout<<\

if(m<0)

cout<

数据结构第二次实验报告

}

}

t1=t1->next; m--;

cout<

void sNode::PloyAdd(sNode s1,sNode s2){

cout<<\他们求和后的多项式是\

Node* t1 = s1.pHead;

Node* t2 = s2.pHead; int m = s1.size; int n = s2.size;

while(m>0&&n>0){

if(t1->no == t2->no ){ }

else if(t1->no > t2->no ){

s1.Print(t1->vol,t1->no); t1=t1->next;m--;

s1.Print(t1->vol + t2->vol ,t1->no ); t1=t1->next ;m--; t2=t2->next ;n--;

数据结构第二次实验报告

}

} else{ }

s2.Print(t2->vol,t2->no); t2=t2->next;n--;

while(m>0){ }

void main(){

sNode N1,N2; }

while(n>0){ }

cout<

s2.Print(t2->vol,t2->no); t2=t2->next; n--;

s1.Print(t1->vol,t1->no); t1=t1->next; m--;

数据结构第二次实验报告

}

N1.setPloy (); N1.PrintInfo ();

N2.setPloy (); N2.PrintInfo ();

N1.PloyAdd (N1,N2);