练习43

1. /***********************************************************************************
3.   43. 对于次数很高，但项目很少的多项式，可用链表来表示。
4.   例如：X^1000－76*X^76＋3*X^3－7可表示为
6.   ┌─┬──┬─┐  ┌──┬─┬─┐   ┌─┬─┬─┐  ┌─┬─┬──┐
7.   │1 │1000│  ┼→│-76 │78│  ┼→ │3 │3 │  ┼→│-7│0 │ NIL│
8.   └─┴──┴─┘  └──┴─┴─┘   └─┴─┴─┘  └─┴─┴──┘
10.  在此方式下，编程完成两个多项式的加法与乘法。
12.   *********************************************************************************/
14. #include <stdio.h>
15. #include <malloc.h>
17. typedef struct tagNode
18. {
19.     int c;
20.     int p;
21.     tagNode *next;
22. } Node;
24. FILE *fp;
26. Node* CreateLink()
27. {
28.     int c,p;
29.     Node *head = NULL;
30.     Node *tail = NULL;
31.     Node *temp = NULL;
33.     fscanf(fp,"%d",&c);
34.     while(c != 0)
35.     {
36.         fscanf(fp,"%d",&p);
37.         temp = (Node*)malloc(sizeof(Node));
38.         temp->c = c;
39.         temp->p = p;
40.         temp->next = NULL;
41.         if(!head)
42.         {
43.             tail = head = temp;
44.         }
45.         else 
46.         {
47.             tail->next = temp;
48.             tail = tail->next;
49.         }
50.         fscanf(fp,"%d",&c);
51.     }
53.     return head;
54. }
56. Node* AddLink(Node *la, Node *lb)
57. {
58.     Node *head=NULL,*tail=NULL,*temp;
59.     Node *s,*t;
60.     s = la;
61.     t = lb;
63.     while(s && t)
64.     {
65.         temp = (Node*)malloc(sizeof(Node));
66.         temp->next = NULL;
67.         if(s->p == t->p)
68.         {
69.             temp->c = s->c + t->c;
70.             temp->p = s->p;
71.             s = s->next;
72.             t = t->next;
73.         }
74.         else if(s->p > t->p)
75.         {
76.             temp->c = s->c;
77.             temp->p = s->p;
78.             s = s->next;
79.         }
80.         else 
81.         {
82.             temp->c = t->c;
83.             temp->p = t->p;
84.             t = t->next;
85.         }
86.         if(!head)
87.         {
88.             head = tail = temp;
89.         }
90.         else 
91.         {
92.             tail->next = temp;
93.             tail = tail->next;
94.         }
95.     }
96.     if(!t)
97.         s = t;
98.     while(s)
99.     {
100.         temp = (Node*)malloc(sizeof(Node));
101.         temp->c = s->c;
102.         temp->p = s->p;
103.         s = s->next;
104.         if(!head)
105.         {
106.             head = tail = temp;
107.         }
108.         else 
109.         {
110.             tail->next = temp;
111.             tail = tail->next;
112.         }
113.     }
115.     return head;
116. }
118. Node* MulLink(Node *la, Node *lb)
119. {
120.     Node *rs=NULL;
121.     Node *s,*t,*pr,*qr;
122.     int c,p;
124.     for(s=la; s; s=s->next)
125.     {
126.         for(t= lb; t; t=t->next)
127.         {
128.             c = s->c * t->c;
129.             p = s->p + t->p;
130.             for(qr=rs,pr=NULL; qr; pr=qr,qr=qr->next)
131.             {
132.                 if(p >= qr->p)
133.                     break;
134.             }
135.             if(qr && p == qr->p)
136.                 qr->c += c;
137.             else
138.             {
139.                 Node *temp;
140.                 temp = (Node*)malloc(sizeof(Node));
141.                 temp->c = c;
142.                 temp->p = p;
143.                 temp->next = NULL;
144.                 if(!qr)
145.                 {
146.                     if(!pr)
147.                         rs = temp;
148.                     else pr->next = temp;
149.                 }
150.                 else
151.                 {
152.                     temp->next = pr->next;
153.                     pr->next = temp;
154.                 }
155.             }
156.         }
157.     }
158.     
159.     return rs;
160. }
162. void PrintLink(Node* l)
163. {
164.     Node* cur = l;
165.     while(cur)
166.     {
167.         if(cur->c > 0 && cur != l)
168.             printf("+"); 
169.         if(cur->p != 0)
170.         {
171.             if(cur->p != 1)
172.             {
173.                 if(cur->c != 1)
174.                 {
175.                     if(cur->c != -1)
176.                         printf("%dX^%d",cur->c,cur->p);
177.                     else printf("-X^%d",cur->p);
178.                 }
179.                 else
180.                     printf("X^%d",cur->p);
181.             }
182.             else
183.             {
184.                 if(cur->c != 1)
185.                 {
186.                     if(cur->c != -1)
187.                         printf("%dX",cur->c);
188.                     else printf("-X");
189.                 }
190.                 else
191.                     printf("X");
192.             }
193.         }
194.         else printf("%d",cur->c);
195.         cur = cur->next;
196.     }
197.     printf("/n");
198. }
200. void main()
201. {
202.     Node *la,*lb,*lc;
204.     fp = fopen("data.txt","r");
205.     if(!fp)
206.     {
207.         printf("Cannot open data file!/n");
208.         return;
209.     }
210.     la = CreateLink();
211.     PrintLink(la);
212.     lb = CreateLink();
213.     PrintLink(lb);
214.     lc = AddLink(la,lb);
215.     PrintLink(lc);
216.     lc = MulLink(la,lb);
217.     PrintLink(lc);
218.     fclose(fp);
219. }