main.cpp

数据结构的一些简单算法

//===========================================================================
//                               main.cpp
//                    [e-mail]
//===========================================================================

#include "list.h"
void Input(list<moNode> &mulist)
{
	//construct new list
	float TemCoef;
	int   TemExp ;
	while(cin>>TemCoef>>TemExp)
	{
		if(TemCoef == 0) break;
		moNode* new_moNode;
		new_moNode = new moNode(TemCoef,TemExp);
		int position; 
		bool SamExp  ;
		SamExp = mulist.ser_position(*new_moNode,position);
		if(SamExp)
		{
			cout<< mulist.add(position,*new_moNode) <<endl ;
		}
		else
		{
			cout<< mulist.insert(position,*new_moNode) << endl ;
		}
	}
	cout << mulist.output() << endl ;
}
void main ()
{
	moNode* new_moNode;
	new_moNode = new moNode;
	list<moNode> mulistA(*new_moNode);
	Input(mulistA);
	new_moNode = new moNode;
	list<moNode> mulistB(*new_moNode);
	Input(mulistB);

	cout << mulistA.add (mulistA,mulistB) << endl ;
	cout << mulistA.output();

	cout << mulistA.mul (mulistA,mulistB) << endl ;
}