浙大DS_第二章_章末练习_多项式计算(链式)

代码未写完,部分功能未实现,仅搭建框架

数据结构_中国大学MOOC(慕课) (icourse163.org)

注意:未明晰,为何传递指针地址,只是指针不可以完成更改数值任务吗?

#include<stdio.h>
#include<stdlib.h>
typedef struct PolyNode {
	int coef;
	int expon;
	struct PolyNode* link;
};
typedef struct PolyNode* Polynomial;

//输出多项式
void PrintPoly(Polynomial P) {
	int flag = 0;
	if (!P) {
		printf("0 0\n");
		return;
	}
	while (P) {
		if (!flag) {
			flag = 1;
		}
		else {
			printf(" ");
		}
		printf("%d %d", P->coef, P->expon);
		P = P->link;
	}
	printf("\n");
}

//为什么传入*pRear  为什么传入pRear的地址啊啊啊
void Attach(int c, int e, Polynomial* pRear) {
	Polynomial P;
	P = (Polynomial)malloc(sizeof(struct PolyNode));
	P->coef = c;   //对新结点赋值
	P->expon = e;
	P->link = NULL;
	(*pRear)->link = P;
	*pRear = P;        //修改pRear值
}

Polynomial ReadPoly() {
	int c, e, N;
	Polynomial Rear, P, t;
	scanf_s("%d", &N);
	P = (Polynomial)malloc(sizeof(struct PolyNode));
	P->link = NULL;
	Rear = P;
	while (N--) {
		scanf_s("%d %d", &c, &e);
		Attach(c, e, &Rear);
	}
	t = P;
	P = P->link;
	free(t);
	return P;

}

Polynomial Mult(Polynomial P1, Polynomial P2) {
	Polynomial Rear, P, t, t1, t2;
	int c, e;

	if (!P1 || !P2) {
		return NULL;
	}
	t1 = P1;
	t2 = P2;
	P = (Polynomial)malloc(sizeof(struct PolyNode));
	P->link = NULL;
	Rear = P;
	while (t2) {
		Attach(t1->coef * t2->coef, t1->expon + t2->expon, &Rear);
		t2 = t2->link;
	}
	t1 = t1->link;
	while (t1) {
		t2 = P2;
		Rear = P;
		while (t2) {
			e = t1->expon + t2->expon;
			c = t1->coef * t2->coef;
			while (Rear->link && Rear->link->expon > e) {
				Rear = Rear->link;
			}
			if (Rear->link && Rear->link->expon == e) {
				if (Rear->link->coef + c) {
					Rear->link->coef += c;
				}
				else {
					t = Rear->link;
					Rear->link = t->link;
					free(t);
				}
			}
			else {
				t = (Polynomial)malloc(sizeof(struct PolyNode));
				t->coef = c;
				t->expon = e;
				t->link = Rear->link;
				Rear->link = t;
				Rear = Rear->link;
			}
			t2 = t2->link;
		}
		t1 = t1->link;
	}
	t2 = P;
	P = P->link;
	free(t2);
	return P;
}

Polynomial Add(Polynomial P1, Polynomial P2) {

	//......

	Polynomial Rear, P, t1, t2;
	t1 = P1;
	t2 = P2;
	P = (Polynomial)malloc(sizeof(struct PolyNode));
	P->link = NULL;
	Rear = P;
	while (t1 && t2) {
		if (t1->expon == t2->expon) {

		}
		else if (t1->expon > t2->expon) {

		}
		else {

		}
	}
	while (t1) {

	}
	while (t2) {

	}
	return P;
}


int main() {
	Polynomial P1, P2, PP, PS;
	//多项式建立
	P1 = ReadPoly();
	P2 = ReadPoly();
	//多项式乘法
	PP = Mult(P1, P2);
	PrintPoly(PP);
	//多项式加法
	PS = Add(P1, P2);
	PrintPoly(PS);

}