#include <iostream>
using namespace std;
typedef struct Node//結點型別
{
int expo;
int coef;
struct Node* next;
}Node, * LinkList;
void InitList(LinkList& L) //初始化鏈表
{
L = new Node;
L->next = NULL;
}
void CreateList(LinkList& L, int n)
{
LinkList p, q;
q= L;
for (int i = 1; i <= n; i++)
{
InitList(p);
cin >> p->coef >> p->expo;
q->next = p;
q = p;
}
}
void ShowList(LinkList& L)
{
LinkList p;
p = L->next;
while (p != NULL)
{
cout << p->coef << " " << p->expo;
p = p->next;
}
}
void AddList(LinkList& L1, LinkList& L2)
{
LinkList p1, p2, p1_pre, temp;//p1_pre為p1之前的前驅
p1_pre = L1;
p1 = L1->next;
p2 = L2->next;
while (p1 != NULL && p2 != NULL)//L1L2均不為空
{
if (p1->expo== p2->expo)
{
int e = p1->coef + p2->coef;
temp = p2;
L2->next = p2->next;
p2 = L2->next;
if (e == 0)
{
temp = p1;
p1_pre->next = p1->next;
p1 = p1_pre->next;
}
else
{
p1->coef = e;
}
}
else if (p1->expo <p2->expo)
{
p2->next = p1_pre->next;
p1_pre = p2;
p2 = p2->next;
}
else if (p1->expo> p2->expo)
{
p1 = p1->next;
p1_pre = p1_pre->next;
}
}
if (p2 != NULL)
{
p1_pre->next = p2;
L2->next = NULL;
}
}
int main()
{
LinkList L1, L2;
int n1, n2;
InitList(L1);
InitList(L2);
cin >> n1>>n2;
CreateList(L1, n1);
CreateList(L2, n2);
AddList(L1, L2);
ShowList(L1);
return 0;
}
uj5u.com熱心網友回復：
僅供參考：//鏈表實作一元多項式的加法減法乘法
#include <stdio.h>
#include <stdlib.h>
typedef struct node {
float coef; //系數
int expn; //指數
struct node *next;
}
PolyNode; //多項式節點 polynomial node
typedef PolyNode* Polynomial;
Polynomial createPolynomial() { //創建多項式
PolyNode *p, *q, *head = (PolyNode *)malloc(sizeof(PolyNode)); //頭節點
head->next = NULL;
float coef;
int expn;
printf("輸入該多項式每一項的系數和指數，每項一行，輸入0 0結束！\n");
while (scanf("%f %d", &coef, &expn) && coef) { // 默認，按指數遞減排列
if (head->next) {
p = head;
while (p->next && expn < p->next->expn)
p = p->next;
if (p->next) {
if (expn == p->next->expn) { //有相同指數的直接把系數加到原多項式
p->next->coef += coef;
if (p->next->coef > -0.000001 && p->next->coef < 0.000001) { //若是相加后系數為0，則舍棄該節點
q = p->next;
p->next = q->next;
free(q);
}
} else {
q = (PolyNode*)malloc(sizeof(PolyNode));
q->coef = coef;
q->expn = expn;
q->next = p->next;
p->next = q;
}
} else {
p->next = (PolyNode*)malloc(sizeof(PolyNode));
p = p->next;
p->coef = coef;
p->expn = expn;
p->next = NULL;
}
} else {
head->next = (PolyNode*)malloc(sizeof(PolyNode));
head->next->coef = coef;
head->next->expn = expn;
head->next->next = NULL;
}
}
return head;
}
Polynomial multiply(Polynomial poly, float coef, int expn) { //多項式與指定單項式相乘，該單項式為 coefx^expn
PolyNode *p, *q, *Poly = (PolyNode*)malloc(sizeof(PolyNode));
p = Poly;
q = poly->next;
while (q) {
p->next = (PolyNode*)malloc(sizeof(PolyNode));
p = p->next;
p->coef = (q->coef*coef);
p->expn = (q->expn + expn);
q = q->next;
}
p->next = NULL;
return Poly;
}
void add(Polynomial poly1, Polynomial poly2) { //把 poly2 加到 poly1 上
PolyNode *p, *q, *r;
r = poly1;
p = poly1->next; //指向第一個節點
q = poly2->next;
poly2->next = NULL;
while (p && q) {
if (p->expn > q->expn) {
r->next = p;
p = p->next;
r = r->next;
} else if (p->expn < q->expn) {
r->next = q;
q = q->next;
r = r->next;
} else {
PolyNode *t;
p->coef += q->coef;
if (!(p->coef > -0.000001 && p->coef < 0.000001)) //系數不為0
{
r->next = p;
r = r->next;
p = p->next;
} else {
t = p;
p = p->next;
free(t);
}
t = q;
q = q->next;
free(t);
}
}
if (p)
r->next = p;
if (q)
r->next = q;
}
Polynomial polySubtract(Polynomial poly1, Polynomial poly2) { //多項式減法 poly1-poly2形成一個新的多項式
//把poly2的系數取相反數，形成一個新的多項式
Polynomial poly = (PolyNode*)malloc(sizeof(PolyNode)); //構造頭節點
PolyNode *p, *q;
p = poly;
q = poly2->next;
while (q) {
p->next = (PolyNode*)malloc(sizeof(PolyNode));
p = p->next;
p->coef = -(q->coef); //系數取反
p->expn = q->expn;
q = q->next;
}
p->next = NULL;
add(poly, poly1); //利用加法
return poly;
}
Polynomial polyAdd(Polynomial poly1, Polynomial poly2) { //多項式相加 poly1+poly2形成一個新的多項式
Polynomial poly = (PolyNode*)malloc(sizeof(PolyNode)); //和多項式的頭節點
poly->next = NULL;
PolyNode *p, *q, *r;
r = poly;
p = poly1->next;
q = poly2->next;
while (p&&q) {
if (p->expn > q->expn) {
r->next = (PolyNode*)malloc(sizeof(PolyNode));
r = r->next;
r->coef = p->coef;
r->expn = p->expn;
p = p->next;
} else if (p->expn < q->expn) {
r->next = (PolyNode*)malloc(sizeof(PolyNode));
r = r->next;
r->coef = q->coef;
r->expn = q->expn;
q = q->next;
} else {
float m = p->coef + q->coef;
if (!(m > -0.000001 && m < 0.000001)) {
r->next = (PolyNode*)malloc(sizeof(PolyNode));
r = r->next;
r->coef = m;
r->expn = p->expn;
}
q = q->next;
p = p->next;
}
}
while (p) {
r->next = (PolyNode*)malloc(sizeof(PolyNode));
r = r->next;
r->coef = p->coef;
r->expn = p->expn;
p = p->next;
}
while (q) {
r->next = (PolyNode*)malloc(sizeof(PolyNode));
r = r->next;
r->coef = q->coef;
r->expn = q->expn;
q = q->next;
}
r->next = NULL;
return poly;
}
Polynomial polyMultiply(Polynomial poly1, Polynomial poly2) { //多項式相乘
Polynomial poly = (PolyNode*)malloc(sizeof(PolyNode)); //創建多項式和的頭節點
poly->next = NULL;
PolyNode *p;
p = poly2->next;
while (p) {
add(poly, multiply(poly1, p->coef, p->expn));
p = p->next;
}
return poly;
}
void printPoly(Polynomial poly) { //列印多項式
if (poly && poly->next) {
PolyNode *p = poly->next; //p指向第一個節點
while (p->next) {
printf("%gx^%d", p->coef, p->expn);
p = p->next;
if (p && (p->coef > 0))
printf("+");
}
if (p->expn == 0)
printf("%g", p->coef); //列印常數項
else
printf("%gx^%d", p->coef, p->expn);
printf("\n");
}
}
void freePoly(Polynomial poly) { //釋放記憶體
if (poly && poly->next) {
PolyNode *p, *q;
p = poly;
while (p) {
q = p->next;
free(p);
p = q;
}
}
poly = NULL;
}
int main() {
printf("用鏈表實作多項式的加減法\n");
Polynomial poly1, poly2, poly3;
printf("創建多項式一\n");
poly1 = createPolynomial();
printf("多項式一：\n");
printPoly(poly1);
printf("創建多項式二\n");
poly2 = createPolynomial();
printf("多項式二：\n");
printPoly(poly2);
printf("兩多項式相加，和為：\n");
poly3 = polyAdd(poly1, poly2);
printPoly(poly3);
freePoly(poly3);
printf("兩個多項式相乘，積為：\n");
poly3 = polyMultiply(poly1, poly2);
printPoly(poly3);
freePoly(poly3);
printf("兩多項式相減，差為：\n");
poly3 = polySubtract(poly1, poly2);
printPoly(poly3);
freePoly(poly1);
freePoly(poly2);
freePoly(poly3);
system("pause");
return 0;
}
轉載請註明出處，本文鏈接：https://www.uj5u.com/houduan/268359.html
標籤：新手樂園