本文实例为大家分享了C语言多项式相加的具体代码，供大家参考，具体内容如下
包含带头节点的链表的初始化，输出：
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
|
#define _CRT_SECURE_NO_WARNINGS#include <stdio.h>#include <stdlib.h>typedef struct Pol{ int coe; // 系数 int index; // 指数 struct Pol *next;}Pol; int main(int argc, char *argv[]){ Pol *head1 = NULL; // 第一个多项式 Pol *head2 = NULL; // 第二个多项式 Pol *Initiate(Pol *head1); // 声明初始化函数 void Output(Pol *head); // 声明输出函数 void PolAdd(Pol *head1, Pol *head2); // 声明相加函数 int coe, index; char sign; Pol *p; int n = 0; // 初始化第一个多项式 head1 = Initiate(head1); p = head1; while (1) { scanf("%dx%d%c", &coe, &index, &sign); p->next = (Pol *)malloc(sizeof(Pol)); p = p->next; p->coe = coe; p->index = index; p->next = NULL; if(sign == '\n') break; } printf("第一多项式输入完毕。\n"); // 初始化第二个多项式 head2 = Initiate(head2); p = head2; while (1) { scanf("%dx%d%c", &coe, &index, &sign); p->next = (Pol *)malloc(sizeof(Pol)); p = p->next; p->coe = coe; p->index = index; p->next = NULL; if (sign == '\n') break; } printf("第二多项式输入完毕。\n"); // 调用相加函数和输出函数 PolAdd(head1, head2); Output(head1); system("PAUSE"); return 0;}// 初始化链表函数Pol *Initiate(Pol *head){ head = (Pol *)malloc(sizeof(Pol)); head->next = NULL; return head;}// 初始化相加函数void PolAdd(Pol *head1, Pol *head2){ Pol *p = head1->next; Pol *q = head2->next; Pol *pre = head1; Pol *temp = NULL; int sum; while ((p != NULL) && (q != NULL)) { if (p->index < q->index) { pre->next = p; pre = pre->next; p = p->next; } else if(p->index == q->index) { sum = p->coe + q->coe; if (sum != 0) { p->coe = sum; pre->next = p; pre = pre->next; p = p->next; // 删除节点 temp = q; q = q->next; free(temp); } else { temp = p; p = p->next; free(temp); temp = q; q = q->next; free(temp); } } else { pre->next = q; pre = pre->next; q = q->next; } } // 两串长度不相等时，把尾部一次加入 if (p != NULL) pre->next = p; else pre->next = q; }// 输出函数void Output(Pol *head){ Pol *p = head; p = p->next; int i = 0; while (p) { if (p->coe > 0 && i != 0) { printf("+%dX^%d", p->coe, p->index); p = p->next; } else { printf("%dX^%d", p->coe, p->index); p = p->next; } i++; }} |
以上就是本文的全部内容，希望对大家的学习有所帮助，也希望大家多多支持服务器之家。
原文链接：https://blog.csdn.net/weixin_44427114/article/details/102141862
