昨天用数组实现了多项式,今天用链表实现了一下。在写代码的过程中,发现以前一直忽略的弱点。在链表的插入过程中要注意开创新的空间,要不修改了以后链表会随着改变。同时申请的空间需要销毁,我这里偷懒没有写了。在看我是歌手,谁是歌王呢。注意函数InsertNode,等下再来详细复习一下
//Using List to achieve Polynomial
#include<iostream>
#include<stdio.h>
using namespace std;
struct Node;
typedef Node *PtrNode;
typedef PtrNode Polynomial;
//struct used to store inform of polynomial
struct Node{
double Coefficient;
double Exponent;
PtrNode Next;
};
//method to initialize
void ZeroPolynomial(Polynomial Poly)
{
Poly->Coefficient=0;
Poly->Exponent=0;
Poly->Next=NULL;
}
//method to find previous
PtrNode FindPrevious(PtrNode PNode,Polynomial Poly)
{
PtrNode TempNode;
TempNode=Poly;
while(TempNode->Next!=PNode)
{
TempNode=TempNode->Next;
}
return TempNode;
}
//method used to insert the node to the right place
void InsertNode(PtrNode InNode,Polynomial Poly)
{
PtrNode TempNode;
PtrNode InsertNodes;
InsertNode