研究了一个星期的单链表合并算法c语言实现devC++正常编译运行

Be_envious

1. #define TRUE 1
   
2. #define FALSE 0
   
3. #define OK 1
   
4. #define ERROR 0
   
5. #define INFEASIBLE -1
   
6. #define OVERFELOW -2
   
7. #include<stdio.h>
   
8. #include<malloc.h>
   
9. 
   
10. typedef int Status;
    
11. typedef int ElemType;
    
12. 
    
13. typedef struct node
    
14. {
    
15. ElemType data;
    
16. struct node * next;
    
17. }node, *LinkList;
    
18. 
    
19. LinkList creat(void);
    
20. void Print(LinkList head);
    
21. void MergeList(LinkList head1,LinkList head2,LinkList head3);
    
22. 
    
23. int main(void)
    
24. {
    
25. LinkList La_head = NULL;
    
26. LinkList Lb_head = NULL;
    
27. LinkList Lc_head = (LinkList)malloc(sizeof(node));
    
28. 
    
29. La_head = creat();
    
30. Lb_head = creat();
    
31. 
    
32. Print(La_head);
    
33. Print(Lb_head);
    
34. 
    
35. MergeList(La_head,Lb_head,Lc_head);
    
36. 
    
37. Print(Lc_head);
    
38. system("pause");
    
39. }
    
40. 
    
41. LinkList creat(void)
    
42. {
    
43. int length;
    
44. int i;
    
45. int veriables;
    
46. 
    
47. LinkList head = (LinkList)malloc(sizeof(node));
    
48. if(NULL == head)
    
49. {
    
50. printf("No enough space!");
    
51. exit(-1);
    
52. }
    
53. 
    
54. LinkList tail = head;
    
55. 
    
56. printf("Input LinkList Length: ");
    
57. scanf("%d",&length);
    
58. printf("\n");
    
59. 
    
60. for(i=0;i<length;++i)
    
61. {
    
62. printf("Input number %d elem: ",i+1);
    
63. scanf("%d",&veriables);
    
64. 
    
65. LinkList pnew = (LinkList)malloc(sizeof(node));
    
66. if(NULL == pnew)
    
67. {
    
68. printf("No enough space!");
    
69. exit(-1);
    
70. }
    
71. 
    
72. pnew->data = veriables;
    
73. tail->next = pnew;
    
74. pnew->next = NULL;
    
75. tail = pnew;
    
76. }
    
77. printf("\n\n");
    
78. return (head);
    
79. }
    
80. 
    
81. void Print(LinkList head)
    
82. {
    
83. LinkList p = head->next;
    
84. 
    
85. while(p)
    
86. {
    
87. printf("%d ",p->data);
    
88. p = p->next;
    
89. }
    
90. printf("\n\n");
    
91. }
    
92. 
    
93. void MergeList(LinkList head1,LinkList head2,LinkList head3)
    
94. {
    
95. LinkList La = head1->next;
    
96. LinkList Lb = head2->next;
    
97. LinkList Lc = head3;
    
98. LinkList q;
    
99. 
    
100. while(La && Lb)
     
101. {
     
102. if(La->data < Lb->data)
     
103. {
     
104. Lc->next = La;
     
105. Lc = La;
     
106. La = La->next;
     
107. }
     
108. else if(La->data == Lb->data)
     
109. {
     
110. Lc->next = La;
     
111. Lc = La;
     
112. La = La->next;
     
113. q = Lb;
     
114. Lb = Lb->next;
     
115. free(q);
     
116. }
     
117. else
     
118. {
     
119. Lc->next = Lb;
     
120. Lc = Lb;
     
121. Lb = Lb->next;
     
122. }
     
123. }
     
124. 
     
125. Lc->next = La ? La : Lb;
     
126. free(head1);
     
127. free(head2);
     
128. }
     

复制代码

研究了一个星期希望对大家有帮助

cqk2980

无回帖，不论坛，这才是人道。