/
交叉合并链表.c
146 lines (139 loc) · 3.31 KB
/
交叉合并链表.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
/*************************************************************************
> File Name: 交叉合并链表.c
> Author: zhuxinquan
> Mail: zhuxinquan61@gmail.com
> Created Time: 2015年09月21日 星期一 21时18分06秒
************************************************************************/
#include<stdio.h>
#include<stdlib.h>
typedef int ElemType;
typedef struct node{
ElemType data;
struct node * next;
}Node, * LinkList;
LinkList Creat_LinkList(int * count)
{
LinkList head = (LinkList)malloc(sizeof(Node));
head->next = NULL;
Node * s, * r = head; //r为尾指针
int x;
printf("input and -1 is over:\n");
scanf("%d", &x);
while(x != -1){
(*count)++;
s = (LinkList)malloc(sizeof(Node));
s->data = x;
s->next = NULL;
r->next = s;
r = s;
scanf("%d", &x);
}
return head;
}
LinkList merge_list(LinkList la, LinkList lb, int count_a, int count_b)
{
Node * pa, * pb, * t, * s, * merge;
t = merge = (LinkList)malloc(sizeof(Node));
t->next = NULL; //t为尾指针
pa = la->next;
pb = lb->next;
if(count_a <= count_b)
{
while(pa && pb)
{
s = (Node *)malloc(sizeof(Node));
s->data = pa->data;
s->next = NULL;
t->next = s;
t = s;
pa = pa->next;
s = (Node *)malloc(sizeof(Node));
s->data = pb->data;
s->next = NULL;
t->next = s;
t = s;
pb = pb->next;
}
while(pa)
{
s = (Node *)malloc(sizeof(Node));
s->data = pa->data;
s->next = NULL;
t->next = s;
t = s;
pa = pa->next;
}
while(pb)
{
s = (Node *)malloc(sizeof(Node));
s->data = pb->data;
s->next = NULL;
t->next = s;
t = s;
pb = pb->next;
}
}
else
{
while(pa && pb)
{
s = (Node *)malloc(sizeof(Node));
s->data = pb->data;
s->next = NULL;
t->next = s;
t = s;
pb = pb->next;
s = (Node *)malloc(sizeof(Node));
s->data = pa->data;
s->next = NULL;
t->next = s;
t = s;
pa = pa->next;
}
while(pa)
{
s = (Node *)malloc(sizeof(Node));
s->data = pa->data;
s->next = NULL;
t->next = s;
t = s;
pa = pa->next;
}
while(pb)
{
s = (Node *)malloc(sizeof(Node));
s->data = pb->data;
s->next = NULL;
t->next = s;
t = s;
pb = pb->next;
}
}
return merge;
}
void print_link(LinkList head)
{
Node * p = head->next;
while(p)
{
printf("%3d", p->data);
p = p->next;
}
printf("\n");
}
int main(void)
{
int count_a, count_b;
LinkList la, lb, merge;
count_a = count_b = 0;
la = Creat_LinkList(&count_a);
lb = Creat_LinkList(&count_b);
printf("la:");
print_link(la);
printf("lb:");
print_link(lb);
merge = merge_list(la, lb, count_a, count_b);
printf("merge:");
print_link(merge);
return 0;
}