有序表归并

#include <bits/stdc++.h>
using namespace std;

struct List{
int data;
List *nxt;
};

int n, m, v, cas;

//创建新表
List *create() {
List *ptrL;
ptrL = new List;
ptrL->nxt = NULL;
return ptrL;
}
//获取当前链表长度
int length(List *ptrL) {
List *p = ptrL ->nxt;
int j = 0;
while § {
p = p->nxt;
j++;
}
return j;
}

//寻找当前元素应该插入到哪个位置
List *find(int v, List *ptrL) {
List *p = ptrL;
if (p->nxt == NULL) return p;
while (p->nxt && p->nxt->data < v) p = p->nxt;
return p;
}

//插入元素
void insert(int v, List *ptrL) {
List *node = new List;
List *p = find(v, ptrL);
node->data = v;
node->nxt = p->nxt;
p->nxt = node;
}

//输出链表
void print(List *ptrL) {
printf(“Case %d:%d\n”, ++cas, length(ptrL));
for (List *tmp = ptrL -> nxt; tmp; tmp = tmp->nxt) {
if (tmp != ptrL->nxt) printf(" “);
printf(”%d", tmp->data);
}
puts("");
}

//释放空间
void clear(List *ptrL) {
List *tmp;
while (ptrL) {
tmp = ptrL->nxt;
delete ptrL;
ptrL = tmp;
}
}

void solve() {
List *ptrL;
ptrL = create();
while (n–) {
scanf("%d", &v);
insert(v, ptrL);
}
scanf("%d", &m);
while (m–) {
scanf("%d", &v);
insert(v, ptrL);
}
print(ptrL);
clear(ptrL);
}

int main() {
freopen(“input1.txt”, “r”, stdin);
freopen(“output1.txt”, “w”, stdout);
while (scanf("%d", &n)!=EOF, n != -1) solve();
return 0;
}