#include <stdio.h>
struct polynomial
{
int coefficient; //* 系数
int index; //* 指数
};
int Final_index = 0; //* 两个一元二项式相加后得到的新的一元二项式的项的个数
void Input(struct polynomial array[], int length); // Todo: 输入一元多项式的系数和指数
struct polynomial *Add_polynomial(struct polynomial array1[], int length1,
struct polynomial array2[], int length2,
struct polynomial array3[], int length3); // Todo: 两个多项式相加
struct polynomial *Array_Sort(struct polynomial array[], int length); // Todo: 将一元多项式按指数的大小由大到小递减排序
void Swap(int *value1, int *value2); // Todo:将value1,value2两个值交换
void Output_Polynomial(struct polynomial array[], int length); // Todo:输出相加后的一元多项式
int main(void)
{
struct polynomial poly1[10], poly2[8], poly3[18];
//! 输入poly1,poly2两个多项式
Input(poly1, 10);
Input(poly2, 8);
//! 将poly1,poly2两个多项式分别按指数的大小由大到小排序
Array_Sort(poly1, 10);
Array_Sort(poly2, 8);
//! poly1+poly2=poly3
Add_polynomial(poly1, 10, poly2, 8, poly3, 18);
//! 输出一元多项式poly3
Output_Polynomial(poly3, Final_index);
return 0;
}
void Input(struct polynomial array[], int length)
{
for (int i = 0; i < length; i++)
{
scanf("%d%d", &array[i].coefficient, &array[i].index);
}
}
struct polynomial *Add_polynomial(struct polynomial array1[], int length1,
struct polynomial array2[], int length2,
struct polynomial array3[], int length3)
{
int i = 0, j = 0, k = 0;
while (i < length1 && j < length2 && k < length3)
{
if (array1[i].index == array2[j].index) //* 如果一元多项式poly1的第i项的指数与一元多项式poly2的第j项的指数相同,则两项相加合并,
{
array3[k].index = array1[i].index;
array3[k].coefficient = array1[i].coefficient + array2[j].coefficient;
i++;
j++;
k++;
}
else if (array1[i].index > array2[j].index) //* 如果一元多项式poly1的第i项的指数 比 一元多项式poly2的第j项的指数大,则将poly1的第i项放到一元多项式poly3中
{
array3[k].index = array1[i].index;
array3[k].coefficient = array1[i].coefficient;
i++;
k++;
}
//* 如果一元多项式poly1的第i项的指数 比 一元多项式poly2的第j项的指数大,则将poly1的第i项放到一元多项式poly3中
else //* 即 array1[i].index < array2[j].index
{
array3[k].index = array2[j].index;
array3[k].coefficient = array2[j].coefficient;
j++;
k++;
}
}
//* 如果一元多项式poly1中的全部项都放入了poly3中,此时poly2还有剩余项,则将poly2剩下的项依次放入poly3中
if (i == length1 && j < length2)
{
while (j < length2 && k < length3)
{
array3[k].index = array2[j].index;
array3[k].coefficient = array2[j].coefficient;
j++;
k++;
}
}
//* 如果一元多项式poly2中的全部项都放入了poly3中,此时poly1还有剩余项,则将poly1剩下的项依次放入poly3中
if (j == length2 && i < length1)
{
while (i < length1 && k < length3)
{
array3[k].index = array1[i].index;
array3[k].coefficient = array1[i].coefficient;
i++;
k++;
}
}
Final_index = k; //* 将此时的一元多项式poly3中项的个数记录下来
return array3;
}
struct polynomial *Array_Sort(struct polynomial array[], int length)
{
int temp; //* 交换的中间值
for (int i = 0; i < length; i++)
{
for (int j = i; j < length; j++)
{
if (array[i].index < array[j].index)
{
Swap(&array[i].index, &array[j].index);
Swap(&array[i].coefficient, &array[j].coefficient);
}
}
}
return array;
}
void Swap(int *value1, int *value2)
{
int temp; //* 中间值
temp = *value1;
*value1 = *value2;
*value2 = temp;
}
void Output_Polynomial(struct polynomial array[], int length)
{
for (int i = 0; i < length - 1; i++)
{
printf(" %dX^%d + ", array[i].coefficient, array[i].index);
}
printf(" %dX^%d", array[length - 1].coefficient, array[length - 1].index);
}