//#include "linklist
h"的定义 #include using namespace std; struct elem { int coef; int exp; }; template class linklist; template class node { friend class linklist; template friend ostream & operatordate
coef; //系数相加 if (p->date
coef ==0) { //系数为0，删除结点p和结点q pre->next=p->next; //删除结点p delete p; p=pre->next; } else { //系数不为0，只删除结点q pre=p; p=p->next; } qre->next=q->next; //删除结点q delete q; q=qre->next; } } if(q) pre->next=q; //将结点q链接在第一个单链表的后面 B->first->next=NULL; } template linklist::linklist() { first=new node; first->next=NULL; } template linklist::~linklist() { node *p=first,*q; while(p) { q=p; p=p->next; delete q; } } //以下是尾接法 template linklist::linklist(T a[],int n) { node *r; node *p; first=new node; first->next=NULL; r=first; for(int i=0;idate=a[i]; r->next=p; r=p;} r->next=NULL; } */ //
