链式存储

点击(此处)折叠或打开

1. /*
   
2.  *题二：设计并实现以下算法：给出用单链表存储多项式的结构，
   
3.  *利用后接法生成多项式的单链表结构，实现两个多项式相加的运算，
   
4.  *并就地逆置加相后的多项式链式。
   
5.  */
   
6. 
   
7. #include <stdio.h>
   
8. #include <malloc.h>
   
9. #include <conio.h>
   
10. #define EQUAL 1
    
11. #define ok 1
    
12. #define error 0
    
13. #define overflow -1
    
14. #define LIST_INIT_STZE 100
    
15. #define LISTINCREMENT 10
    
16. 
    
17. typedef struct STU {
    
18.     int e;
    
19.     int c;
    
20. }ElemType;
    
21. 
    
22. typedef struct LNODE {
    
23.     ElemType data;
    
24.     struct LNODE *next;
    
25. }LNode, *LinkList;
    
26. 
    
27. int Init(LinkList *L)
    
28. {
    
29.     *L=(LNode *)malloc(sizeof(LNode));
    
30.     if(!L)
    
31.         exit(error);
    
32.     (*L)->next=NULL;
    
33.     return ok;
    
34. }
    
35. 
    
36. int PrintList (LinkList L)
    
37. {
    
38.     LinkList p;
    
39.     p=L->next;
    
40.     while(p)
    
41.     {
    
42.         printf ("%d*X^%d",p->data.c,p->data.e);
    
43.         if (p->next!=NULL)
    
44.             printf ("+");
    
45.         p=p->next;
    
46.     }
    
47.     printf ("\n");
    
48. }
    
49. 
    
50. int CreateMult (LinkList L)
    
51. {
    
52.     int n;
    
53.     int i;
    
54.     ElemType e;
    
55.     scanf ("%d", &n);
    
56.     for (i=1;i<=n;i++)
    
57.     {
    
58.         printf ("e of %d elem:", i);
    
59.         scanf ("%d", &e.e);
    
60.         printf ("c of %d elem:", i);
    
61.         scanf ("%d", &e.c);
    
62.         Insert (L, e);
    
63.     }
    
64. }
    
65. 
    
66. int Convert (LinkList *L)
    
67. {
    
68.     LinkList p,q,r;
    
69.     p=*L;
    
70.     q=p->next;
    
71.     r=q->next;
    
72.     while (q)
    
73.     {
    
74.         q->next=p;
    
75.         if (q->next==(*L))
    
76.             q->next=NULL;
    
77.         p=q;
    
78.         q=r;
    
79.         r=q->next;
    
80.     }
    
81.     (*L)->next=p;
    
82.     return 0;
    
83. }
    
84. 
    
85. int Insert (LinkList L, ElemType e)
    
86. {
    
87.     LinkList p,s;
    
88.     p=L;
    
89.     while (p->next!=NULL)
    
90.         p=p->next;
    
91.     s=(LinkList)malloc(sizeof(LNode));
    
92.     s->data=e;
    
93.     s->next=NULL;
    
94.     p->next=s;
    
95. }
    
96. 
    
97. int CompareE (ElemType e1, ElemType e2)
    
98. {
    
99.     if (e1.e==e2.e)
    
100.         return 1;
     
101.     else
     
102.         return 0;
     
103. }
     
104. 
     
105. int Less_Compare (ElemType e1, ElemType e2)
     
106. {
     
107.     
     
108.     if (e1.e<e2.e)
     
109.         return 1;
     
110.     else
     
111.         return 0;
     
112. }
     
113. 
     
114. int Compute (LinkList la, LinkList lb, LinkList lc)
     
115. {
     
116.     ElemType e;
     
117.     LinkList pa;
     
118.     LinkList pb;
     
119.     pa=la->next;
     
120.     pb=lb->next;
     
121.     while(pa&&pb)
     
122.     {
     
123.         if (CompareE (pa->data,pb->data))
     
124.         {
     
125.             e.c=(pa->data.c)+(pb->data.c);
     
126.             e.e=pa->data.e;
     
127.             Insert (lc, e);
     
128.             pa=pa->next;
     
129.             pb=pb->next;
     
130.         }
     
131.         else if(Less_Compare(pa->data,pb->data))
     
132.         {
     
133.             Insert (lc, pb->data);
     
134.             pb=pb->next;
     
135.         }
     
136.         else
     
137.         {
     
138.             Insert (lc, pa->data);
     
139.             pa=pa->next;
     
140.         }
     
141.     }
     
142.     while (pa)
     
143.     {
     
144.         Insert(lc, pa->data);
     
145.         pa=pa->next;
     
146.     }
     
147.     while (pb)
     
148.     {
     
149.         Insert(lc, pb->data);
     
150.         pb=pb->next;
     
151.     }
     
152. }
     
153. 
     
154. int main ()
     
155. {
     
156.     LinkList la, lb, lc;
     
157. 
     
158.     clrscr();
     
159.     Init (&la);
     
160.     printf ("Create la:");
     
161.     CreateMult (la);
     
162. 
     
163.     clrscr();
     
164.     Init (&lb);
     
165.     printf ("Create lb:");
     
166.     CreateMult (lb);
     
167. 
     
168.     clrscr();
     
169.     printf ("Show la:");
     
170.     PrintList (la);
     
171.     printf ("Show lb:");
     
172.     PrintList (lb);
     
173. 
     
174. 
     
175.     Init (&lc);
     
176.     Compute (la, lb, lc);
     
177.     printf ("Show lc:");
     
178.     PrintList (lc);
     
179.     Convert (&lc);
     
180.     PrintList (lc);
     
181.     getch();
     
182. }