实现多项式的加减乘运算:
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
using namespace std;
typedef struct
{
double coef;//系数
int expn;//指数
}term;
typedef struct LNode
{
term data;
LNode *next;
}*Link, *Linklist;
Linklist La, Lb, Lc, Ld, Le, Lf;
int cmp(term a, term b)
{
if(a.expn == b.expn) return 0;
else return (a.expn - b.expn) / abs(a.expn - b.expn);
}
int ElemLocate(Linklist L, term e, Link &S, Link &Q, int (*compara)(term, term))
{
Link p;
S = L; p = S->next;
while(p && compara(p->data, e) != 0)
{
S = p;
p = p->next;
}
if(!p)
{
S = Q = NULL;
return 0;
}
else
{
Q = p;
return 1;
}
}
void Orderinsert(Linklist &L, term e, int (*compara)(term, term))
{
Link o, p, q;
q = L; p = q->next;
while(p && compara(p->data, e) < 0)
{
q = p;
p = p->next;
}
o = (Link)malloc(sizeof(LNode));
o->data = e;
q->next = o;
o->next = p;
}
void DeleteElem(Linklist &L, Link S)
{
Link Q = S->next;
S->next = Q->next;
free(Q);
}
void InsertElem(Linklist &L, term e, int (*compara)(term, term), char op)
{
Link Q, S;
if(ElemLocate(L, e, S, Q, compara))//存在当前指数
{
switch(op)
{
case '+': Q->data.coef += e.coef; break;
case '-': Q->data.coef -= e.coef;
}
if(!Q->data.coef)
DeleteElem(L, S);
}
else