linkedlist.h

数据结构及C++相关的一些小程序

struct Term
{
   	double coeff;   //多项式其中一项的系数
   	int power;      //多项式其中一项的指数
	Term *next;     //指向下一个节点指针
};

class LinkedList
{
	public:
		LinkedList();
		LinkedList(double c,int p);          //构造函数将头节点初始化
		void display() const;                //输出该单向链表中节点的全部内容，即整个多项式
		void push_back(double c,int p);      //在链表尾部添加一个节点
		void destroy();                      //完成全部操作后，释放给链表分配的内存空间
		friend double poly(LinkedList & f, double x);
	private:
		Term *head;                          //头指针
		Term *tail;                          //尾指针
};


/*以下是成员函数的具体实现*/

LinkedList::LinkedList()
{
   head=NULL;
   tail=NULL;
}


LinkedList::LinkedList(double c,int p)
{  
   head=new Term;
   tail=head;
   head->coeff=c;
   head->power=p;
   head->next=NULL;
}


void LinkedList::display() const
{
	Term *current;
	current=head;
	cout<<"创建的多项式如下："<<endl;
	while(current!=NULL)
	{
		if(current==tail)
		{
			cout<<current->coeff<<"x^"<<current->power<<endl;
			current=current->next;
		}
        else
		{
			cout<<current->coeff<<"x^"<<current->power<<"+";
		    current=current->next;
		}
	}
}



void LinkedList::push_back(double c,int p)
{
	Term *newNode;
	newNode=new Term;
	newNode->coeff=c;
	newNode->power=p;

	tail->next=newNode;
    newNode->next=NULL;
	tail=tail->next;
}


void LinkedList::destroy()
{
    Term *temp;
	while(head!=NULL)
	{
		temp=head;
		head=head->next;
		delete temp;
	}
	tail=NULL;
}