[数据结构]一元多项式的表示与相加

/*
 * @Author: 
 * @Date: 2019-12-03 20:48:51
 * @Last Modified by: 
 * @Last Modified time: 2019-12-03 21:05:06
 */

#include <iostream>

#include <cstdio>

using namespace std;

typedef int Status;
typedef int Elem;

typedef struct PNode
{
	float coef; //系数
	int expn;   //指数
	struct PNode *next;
} PNode, *Polynomial;

Status CreatPolyn(Polynomial &P, int n)
{
	P = new PNode;
	P->next = NULL;

	for (int i = 1; i <= n; ++i)
	{
		PNode *s = new PNode;
		cin >> s->coef >> s->expn;

		PNode *pre = P;
		PNode *q = P->next;

		while (q&&q->expn < s->expn) //尾插 看指数大小然后就往后面走
		{
			pre = q;
			q = q->next;
		}
		s->next = q;
		pre->next = s;//找到位子 插入
	}

	return 1;
}

Status AddPolyn(Polynomial &Pa, Polynomial &Pb) //合并
{
	PNode *p1, *p2, *p3 = Pa;
	p1 = Pa->next, p2 = Pb->next;
	p3 = Pa;

	while (p1&&p2)
	{
		int sum = 0;
		PNode *r;
		if (p1->expn == p2->expn) //如果指数一样大 P1增大 p3负责在路上链接
		{
			sum = p1->coef + p2->coef;
			if (sum)
			{
				p1->coef = sum;
				p3->next = p1;
				p3 = p1;

				p1 = p1->next;
				p2 = p2->next;

			}

			else {// 空的话 就看后面的
				r = p1, p1 = p1->next;  
				r = p2, p2 = p2->next;
			}
		}
		else if (p1->expn < p2->expn)
		{
			//连接 p1 后移
			p3->next = p1;
			p3 = p1;
			p1 = p1->next;
		}
		else
		{
			//连接p2 后移
			p3->next = p2;
			p3 = p2;
			p2 = p2->next;
		}
		p3->next = p1 ? p1 : p2; //三元操作符 p1还有就连接p1 否则连接p2
		delete Pb;
	}
	return 1;
}

int main()
{

	Polynomial P1, p2;
-	
	//1
	CreatPolyn(P1, 1);
	CreatPolyn(p2, 1);
	
	//1
	AddPolyn(P1, p2);

	cout <<P1->next->coef << " " << P1->next->expn << " ";
}