单链表LA=(a1，a2，…，am)和LB=(b1，b2，…，bn)，编写程序按以下规则将它们合并...

蜗牛你慢点

1. /*
   
2. 
   
3. 开发者：慢蜗牛 开发时间：2020.6.11
   
4. 
   
5. 程序功能：合并链表
   
6. 
   
7. */
   
8. 
   
9. #include<stdio.h>
   
10. #include<malloc.h>
    
11. #include<stdlib.h>
    
12. #define LEN sizeof(struct L)
    
13. 
    
14. void print(struct L* head);
    
15. void insert(struct L* p1, struct L* p2);
    
16. 
    
17. struct L//创建结构体
    
18. {
    
19. int a;
    
20. 
    
21. struct L* next;
    
22. };
    
23. 
    
24. int n;
    
25. 
    
26. struct L* creat()//建立链表
    
27. {
    
28. struct L* head;
    
29. 
    
30. struct L* p1, * p2;
    
31. 
    
32. n = 0;
    
33. 
    
34. p1 = p2 = (struct L*)malloc(LEN);
    
35. 
    
36. scanf_s("%d", &p1->a);
    
37. 
    
38. head = NULL;
    
39. 
    
40. while (p1->a != -1)
    
41. {
    
42.     n = n + 1;
    
43. 
    
44.     if (n == 1) head = p1;
    
45. 
    
46.     else p2->next = p1;
    
47. 
    
48.     p2 = p1;
    
49. 
    
50.     p1 = (struct L*)malloc(LEN);
    
51. 
    
52.     scanf_s("%d", &p1->a);
    
53. }
    
54. 
    
55. p2->next = NULL;
    
56. 
    
57. return(head);
    
58. }
    
59. 
    
60. void print(struct L* head)//输出具有头结点的列表
    
61. {
    
62. struct L* p;
    
63. 
    
64. p = head->next;
    
65. 
    
66. if (head != NULL)
    
67.     do
    
68.     {
    
69.         printf("--%d ", p->a);
    
70. 
    
71.         p = p->next;
    
72.     } while (p != NULL);
    
73. }
    
74. 
    
75. void insert(struct L* p1, struct L* p2)//从小到大合并递增链表
    
76. {
    
77. struct L* LC, * r;
    
78. 
    
79. LC = (struct L*)malloc(LEN);
    
80. 
    
81. LC->next = p1;
    
82. 
    
83. r = LC;
    
84. 
    
85. while (p1 && p2)
    
86. {
    
87.     if (p1->a <= p2->a)
    
88.     {
    
89.         r->next = p1;
    
90. 
    
91.         r = p1;
    
92. 
    
93.         p1 = p1->next;
    
94.     }
    
95. 
    
96.     else
    
97.     {
    
98.         r->next = p2;
    
99. 
    
100.         r = p2;
     
101.    
     
102.         p2 = p2->next;
     
103.     }
     
104. 
     
105. }
     
106. if (p1 == NULL) r->next = p2;
     
107. 
     
108. else r->next = p1;
     
109. 
     
110. print(LC);
     
111. }
     
112. 
     
113. void main()//主函数
     
114. {
     
115. struct L* LA, * LB;
     
116. 
     
117. printf("请输入LA的数据：");
     
118. 
     
119. LA = creat();
     
120. 
     
121. printf("请输入LB的数据：");
     
122. 
     
123. LB = creat();
     
124. 
     
125. printf("LC=");
     
126. 
     
127. insert(LA, LB);
     
128. }

复制代码