如何用C语言实现单链表进行多项式加法运算？

本文共计855个文字，预计阅读时间需要4分钟。

本文以一个示例代码展示了如何使用C语言实现单链表，并实现多项式的相加和相乘功能。以下为代码内容：

c#include #include

// 定义链表节点结构体typedef struct Node { int coef; // 系数 int exp; // 指数 struct Node *next;} Node;

// 创建新节点Node* createNode(int coef, int exp) { Node *newNode=(Node*)malloc(sizeof(Node)); if (!newNode) { return NULL; } newNode->coef=coef; newNode->exp=exp; newNode->next=NULL; return newNode;}

// 插入节点到链表头部void insertNode(Node **head, int coef, int exp) { Node *newNode=createNode(coef, exp); newNode->next=*head; *head=newNode;}

// 打印链表void printList(Node *head) { while (head !=NULL) { printf(%dx^%d , head->coef, head->exp); head=head->next; } printf(\n);}

// 多项式相加Node* addPolynomials(Node *p1, Node *p2) { Node *result=NULL, *p=NULL, *q=NULL; p=p1; q=p2; while (p !=NULL && q !=NULL) { if (p->exp > q->exp) { insertNode(&result, p->coef, p->exp); p=p->next; } else if (p->exp exp) { insertNode(&result, q->coef, q->exp); q=q->next; } else { int sum=p->coef + q->coef; if (sum !=0) { insertNode(&result, sum, p->exp); } p=p->next; q=q->next; } } while (p !=NULL) { insertNode(&result, p->coef, p->exp); p=p->next; } while (q !=NULL) { insertNode(&result, q->coef, q->exp); q=q->next; } return result;}

// 多项式相乘Node* multiplyPolynomials(Node *p1, Node *p2) { Node *result=NULL; for (Node *p=p1; p !=NULL; p=p->next) { for (Node *q=p2; q !=NULL; q=q->next) { int coef=p->coef * q->coef; int exp=p->exp + q->exp; insertNode(&result, coef, exp); } } return result;}

// 释放链表内存void freeList(Node *head) { Node *temp; while (head !=NULL) { temp=head; head=head->next; free(temp); }}

int main() { Node *p1=NULL, *p2=NULL, *result=NULL;

// 创建多项式 p1: 2x^3 + 3x^2 + 1x + 5 insertNode(&p1, 2, 3); insertNode(&p1, 3, 2); insertNode(&p1, 1, 1); insertNode(&p1, 5, 0);

// 创建多项式 p2: 4x^3 + 2x^2 + 3x + 1 insertNode(&p2, 4, 3); insertNode(&p2, 2, 2); insertNode(&p2, 3, 1); insertNode(&p2, 1, 0);

printf(多项式 p1: ); printList(p1); printf(多项式 p2: ); printList(p2);

// 多项式相加 result=addPolynomials(p1, p2); printf(多项式相加结果: ); printList(result);

// 释放链表内存 freeList(p1); freeList(p2); freeList(result);

return 0;}

本文实例为大家分享了C语言单链表实现多项式相加的具体代码，供大家参考，具体内容如下

//多项式的相加和相乘 #include<stdio.h> #include<stdlib.h> #pragma warning(disable:4996)//兼容scanf typedef struct node { int coef; int expon; struct node* link; }Polynode,*Polynomial; Polynomial InsertPolyLinklist(Polynomial in,Polynomial Pread) { Pread->link = in; Pread = in; in->link = NULL; return Pread; } Polynomial ReadPoly(void) { Polynomial Pread = (Polynomial)malloc(sizeof(Polynode)); Pread->link = NULL; Polynomial H = Pread; int N; scanf("%d ", &N); while (N--) { Polynomial p = (Polynomial)malloc(sizeof(Polynode)); scanf("%d %d", &p->coef, &p->expon); Pread= InsertPolyLinklist(p,Pread); } Polynomial F; F = H->link; free(H); return F; } void PrintPoly(Polynomial F) { while(F != NULL) { printf("%d %d ", F->coef, F->expon); F = F->link; } printf("\n"); } Polynomial Add(Polynomial p1, Polynomial p2) { Polynomial t1=p1,t2=p2; Polynomial p=(Polynomial)malloc(sizeof(Polynode)); p->link = NULL; Polynomial q = p; Polynomial read; while (t1&&t2) { if (t1->expon == t2->expon) { if (t1->coef + t2->coef) { t1->coef = t1->coef + t2->coef; t1->expon = t1->expon; read = t1; q->link = read; q = read; t1 = t1->link; t2 = t2->link; } } else { if (t1->expon > t2->expon){ read = t1; q->link = read; q = read; t1 = t1->link; } else { if (t1->expon < t2->expon) { read = t2; q->link = read; q = read; t2 = t2->link; } } } } if (t1) { q->link = t1; } if (t2) { q->link = t2; } Polynomial F = p->link; free(p); return F; } int main(void) { Polynomial p1, p2, pp, ps; p1 = ReadPoly(); PrintPoly(p1); p2 = ReadPoly(); PrintPoly(p2); pp = Add(p1, p2); PrintPoly(pp); // ps = Mult(p1, p2); // PrintPoly(ps); return 0; }

参考

MOOC 浙大数据结构

以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持自由互联。