实习2.txt

一个用链表求多项式的编码

nclude<iostream>
#include<fstream>
using namespace std;

void creatnode(fstream &fin,pointer &h) //创建链表将数据读入，h为表头结点
{
   pointer p;pointer q;
   int i;
   h=new node;
   p=h；
   for(i=1;i++)
   {
	   p->next=new node;
	   p->next=p;
	   q=p->next;

   }

}
 
class node
{
	int coef;int expn;
	int
	node *next;
	node(int ceoval,int expval,node *nextval=NULL)
	{
		
		coef =ceoval;
		expn=expval;
		next=nextval;
	}
	node(node *nextval=NULL)
	{next=nextval;}
	~node(){}

};
void addpoly(POLYNAMIAL &pa,POLYNAMIAL &pb) //将多项式pb加到pa上
{
	node *p,q,u,pre;  //pre表示p指针前面的结点
	p=pa->next;hb=pb->next;pre=pa;
	while((ha!=null)&&(hb!=null)
	{
		if(p->expn<q->expn)
		{
			pre=p;p=p->next;//不能插入，p前进一项
		}else
			if(p->expn==q->expn)
			{
				x=p->eoef+q->coef;
				if(x!=0)
				{
					p->coef=x;pre=p;
			
				}else
				{
					pre->next=p->next;
					free(p);//删除p所指的结点
				}
				p=pre->next;
				q=u;
				q=q->next;
				free(u);



	
			}
			else if
			{
                (p->next>q->next)
				{
					u=q->next;
					q->next=p;
					pre->next=q;
					pre=q;
					q=u;
				}

			}
         if(q!=NULL)
			 pre->next=q;

	}
}

}
void main()
{
   node *ha,*hb;	
	setlocale(LC_ALL,"");
	ifstream fin("实习2数据.txt");
	setpolyn(ha,fin);
	setpolyn(hb,fin);
	fin.close();
}