【8560】采用单向链表实现一元多项式的存储并实现两个多项式相加并输出结果

关注公众号程序猿从入门到入土查询更方便哦

采用单向链表实现一元多项式的存储并实现两个多项式相加并输出结果

#define _CRT_SECURE_NO_WARNINGS

#include

using namespace std;

typedef struct node {

	node* next;
	int x, z;

}LNode, * LinkList;

int main() {

	int n;
	cin >> n;

	LinkList L1 = new LNode;
	LinkList p = L1;
	for (int i = 0; i < n; i++) {
		LinkList temp = new LNode;
		scanf("%d,%d", &temp->x, &temp->z);
		temp->next = NULL;
		p->next = temp;
		p = p->next;
	}

	cin >> n;

	LinkList L2 = new LNode;
	p = L2;
	for (int i = 0; i < n; i++) {
		LinkList temp = new LNode;
		scanf("%d,%d", &temp->x, &temp->z);
		temp->next = NULL;
		p->next = temp;
		p = p->next;
	}

	LinkList L3 = new LNode;

	LinkList p1, p2;
	p1 = L1->next;
	p2 = L2->next;

	p = L1->next;				//后指针
	LinkList q = L2->next;
	LinkList pre = L1;			//前指针
	LinkList u;					//临时存储


	while (p != NULL && q != NULL) {		//当p,q不为空

		if (p->z < q->z) {					//p系数小于q系数
			pre = p; p = p->next;			//p指针后移
		}
		else if (p->z == q->z) {			//如果指数相等
			float x = p->x + q->x;				//系数相加
			if (x != 0) {							//系数不等于0
				p->x = x;								//赋值后将p给pre
				pre = p;
			}
			else {									//系数等于0
				pre->next = p->next;					//指向下一个结点
				free(p);								//删除结点
			}
			p = pre->next;					//p指针后移
			u = q;							//保留q以备删除
			q = q->next;					//q指针后移
			free(u);
		}
		else {								//p系数大于q系数
			u = q->next;					//将q接在pre后
			q->next = p;
			pre->next = q;
			pre = q;
			q = u;
		}
	}
	if (q) {					//如果q不为空，将q接在后面
		pre->next = q;
	}
	free(L2);		//删除L2头节点

	LinkList temp = L1->next;		//输出链表
	while (temp != NULL) {

		if (temp->x != 0)
			printf("%d*x^%d ", temp->x, temp->z);
		temp = temp->next;
	}


	return 0;
}