数据结构一元多项式的创建、显示、相加、相减、相乘

最新推荐文章于 2025-06-21 20:17:38 发布

原创

最新推荐文章于 2025-06-21 20:17:38 发布 · 3.6k 阅读

CC 4.0 BY-SA版权

#include"Polyn.h"

void main()
{
	Polynomial pa,pb,pc;
	InitPolyn(pa);
	InitPolyn(pb);
	InitPolyn(pc);
	int m;
	int select = 1;
	while(select)
	{
	    printf("******************************************\n");
		printf("**1. 创建多项式pa        2. 创建多项式pb**\n");
		printf("**3. 显示多项式pa        4. 显示多项式pb**\n");
		printf("**5. 多项式相加          6. 多项式相减  **\n");
		printf("**7. 多项式相乘          0. 退出系统    **\n");
		printf("请选择：");
		scanf("%d",&select);

		if(select == 0)
			break;
		switch(select)
		{
		case 1:
			printf("请输入多项式的项数：");
			scanf("%d",&m);
			CreatePolyn(pa,m);
			break;
		case 2:
			printf("请输入多项式的项数：");
			scanf("%d",&m);
			CreatePolyn(pa,m);
			break;
		case 3:
			printf("pa = ");
			ShowPolyn(pa);
			break;
		case 4:
			printf("pb = ");
			ShowPolyn(pb);
			break;
		case 5:
			AddPolyn(pc,pa,pb); //pc = pa + pb;
			printf("pc = ");
			ShowPolyn(pc);
			break;
		case 6:
			SubPolyn(pc,pa,pb);
			printf("pc = ");
			ShowPolyn(pc);
			break;
		case 7:
			MulPolyn(pc,pa,pb);
			printf("pc = ");
			ShowPolyn(pc);
			break;
		default:
			break;
		}

	}
}

#include"Polyn.h"

void InitPolyn(Polynomial &head)
{
	head = (PolynNode *)malloc(sizeof(PolynNode));
	assert(head != NULL);
	head->data.coef = 0;
	head->data.expn = -1;
	head->link = NULL;
}

void push_back(Polynomial &hea