-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathpolynomial.c
312 lines (276 loc) · 7.97 KB
/
polynomial.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
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
//
// Created by Once on 2019/6/26.
//
#include "polynomial.h"
#include <stdlib.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
/**
* 单个多项式自身的运算,包括初始化、检查是否空或已满、添加表达式、获取单项、清除数据
* */
Polynomial* poly_init(){
Polynomial *polynomial = (Polynomial*)malloc(sizeof(Polynomial));
if(!polynomial){
perror("init polynomial failed.");
return NULL;
}
polynomial->head = NULL;
polynomial->tail = NULL;
polynomial->size = 0;
return polynomial;
}
int poly_is_empty(Polynomial *polynomial){
return polynomial->size == 0;
}
int poly_is_full(Polynomial *polynomial){
Item *item = (Item*)malloc(sizeof(Item));
if(!item)
return 1;
free(item);
return -1;
}
int poly_add(Polynomial *polynomial, Expression *expression){
if(polynomial == NULL || expression == NULL)
return -1;
Item *item = (Item*)malloc(sizeof(Item));
if(!item){
perror("init item failed.");
return -1;
}
item->expression.coefficient = expression->coefficient;
item->expression.exponent = expression->exponent;
item->next = NULL;
if(!polynomial->head){
polynomial->head = item;
polynomial->tail = item;
polynomial->size++;
return 1;
}
Item *node = polynomial->head;
while(node){
if(item->expression.exponent == node->expression.exponent){
node->expression.coefficient += item->expression.coefficient;
return 1;
}
node = node->next;
}
polynomial->tail->next = item;
polynomial->tail = item;
polynomial->size++;
return 1;
}
Expression* poly_get(Polynomial *polynomial, float exponent){
Item *item = polynomial->head;
while(item){
if(item->expression.exponent == exponent)
return &item->expression;
item = item->next;
}
return NULL;
}
int poly_delete(Polynomial *polynomial, float exponent){
Item *item = polynomial->head;
if(item->expression.exponent == exponent){
polynomial->head = item->next;
free(item);
polynomial->size--;
return 1;
}
while(item->next){
Item *temp = item->next;
if(temp->expression.exponent == exponent){
item->next = temp->next;
if(polynomial->tail == temp)
polynomial->tail = item;
free(temp);
polynomial->size--;
return 1;
}
item = item->next;
}
return -1;
}
int poly_clear(Polynomial *polynomial){
Item *item = polynomial->head;
while(item){
Item *temp = item->next;
free(item);
item = temp;
}
return 1;
}
/**
* 多项式的运算:多项式相加、相减、相乘
* 单个多项式求导数/微商、积分(定积分和不定积分)
* */
static void expression_add(Polynomial *polynomial, Item *item){
while(item){
Expression expression;
expression.coefficient = item->expression.coefficient;
expression.exponent = item->expression.exponent;
poly_add(polynomial, &expression);
item = item->next;
}
}
Polynomial* poly_plus(Polynomial *poly1, Polynomial *poly2){
if(poly1 == NULL || poly2 == NULL)
return NULL;
Polynomial *polynomial = poly_init();
if(!polynomial)
return NULL;
Item *item1 = poly1->head;
Item *item2 = poly2->head;
expression_add(polynomial, item1);
expression_add(polynomial, item2);
return polynomial;
}
// sub1 - sub2
Polynomial* poly_subtract(Polynomial *sub1, Polynomial *sub2){
if(sub1 == NULL || sub2 == NULL)
return NULL;
Polynomial *polynomial = poly_init();
if(!polynomial)
return NULL;
Item *item1 = sub1->head;
Item *item2 = sub2->head;
while(item2){
item2->expression.coefficient = - item2->expression.coefficient;
item2 = item2->next;
}
item2 = sub2->head;
expression_add(polynomial, item1);
expression_add(polynomial, item2);
item2 = sub2->head;
while(item2){
item2->expression.coefficient = - item2->expression.coefficient;
item2 = item2->next;
}
return polynomial;
}
Polynomial* poly_multiply(Polynomial *poly1, Polynomial *poly2){
if(poly1 == NULL || poly2 == NULL)
return NULL;
Polynomial *polynomial = poly_init();
if(!polynomial)
return NULL;
Item *item1 = poly1->head;
Item *item2 = poly2->head;
while(item1){
while(item2){
Expression expression;
expression.coefficient = item1->expression.coefficient * item2->expression.coefficient;
expression.exponent = item1->expression.exponent + item2->expression.exponent;
poly_add(polynomial, &expression);
item2 = item2->next;
}
item2 = poly2->head;
item1 = item1->next;
}
return polynomial;
}
Polynomial* poly_differential(Polynomial *poly){
if(poly == NULL)
return NULL;
Polynomial *polynomial = poly_init();
if(!polynomial)
return NULL;
Item *item = poly->head;
while(item){
Expression expression;
expression.coefficient = item->expression.coefficient * item->expression.exponent;
expression.exponent = item->expression.exponent == 0 ? 0 : item->expression.exponent - 1;
poly_add(polynomial, &expression);
item = item->next;
}
return polynomial;
}
Polynomial* poly_in_integral(Polynomial *poly){
if(poly == NULL)
return NULL;
Polynomial *polynomial = poly_init();
if(!polynomial)
return NULL;
Item *item = poly->head;
while(item){
Expression expression;
expression.coefficient = item->expression.coefficient / (item->expression.exponent + 1);
expression.exponent = item->expression.exponent + 1;
poly_add(polynomial, &expression);
item = item->next;
}
return polynomial;
}
float poly_integral(Polynomial *poly, float lower, float upper){
Polynomial *polynomial = poly_in_integral(poly);
if(!polynomial){
perror("can not solve integral function.");
return -1;
}
float result = poly_algebraic_value(polynomial, upper) - poly_algebraic_value(polynomial, lower);
poly_clear(polynomial);
return result;
}
// 计算多项式的代数值
extern float poly_algebraic_value(Polynomial *poly, float value){
if(poly == NULL){
perror("null pointer exception.");
return -1;
}
float count = 0;
Item *item = poly->head;
while(item){
count += item->expression.coefficient * powf(value, item->expression.exponent);
item = item->next;
}
return count;
}
// 以字符串的形式输出多项式代数式
// 计算整数位数
int int_bit(int value){
if(value < 0)
value = - value;
int bit = 1, exp = 10;
while(value / exp > 0){
bit++;
exp *= 10;
}
return bit;
}
char* poly_algebraic_expression(Polynomial *poly){
if(poly == NULL)
return NULL;
int len = 0;
Item *item = poly->head;
int len_arr[poly->size];
int i = 0;
while(item){
int temp = int_bit((int)item->expression.coefficient) + int_bit((int)item->expression.exponent);
len_arr[i] = temp;
len = len + temp;
item = item->next;
i++;
}
item = poly->head;
len = len + 5 * poly->size;
char *str = (char*)malloc(len * sizeof(char));
memset(str, 0, len * sizeof(char));
i = 0;
while(item){
char temp[len_arr[i]];
char *exp = "%.0fX^%.0f";
float coefficient = item->expression.coefficient;
if(coefficient < 0 && i != 0){
coefficient = - coefficient;
exp = " - %.0fX^%.0f";
}
if(item->expression.coefficient > 0 && i != 0){
exp = " + %.0fX^%.0f";
}
sprintf(temp, exp, coefficient, item->expression.exponent);
strcat(str, temp);
item = item->next;
i++;
}
return str;
}