C/C++利用链表实现顺序表的合并

//预编译区::
#include "stdafx.h"
#include<iostream>
#include<stdio.h>
#define OK 1
#define ERROR 0
#define GT 1
#define EQ 0
#define LT -1

using namespace std;

//数据结构声明区:
typedef struct Lnode{
	char data;
	struct Lnode *next;
}LinkList;

//函数声明区:
void InitLink(LinkList &L);
void InsertLink(LinkList *tail, LinkList *s);
int LengthLink(LinkList &L);
void CreatLink(LinkList &L);
void DispLink(LinkList &L, char c);
void SortLink(LinkList &L);
void Merge(LinkList A, LinkList B, LinkList &Temp);

//主函数区:
int main(void)
{
	LinkList A, B, C;
	InitLink(A); InitLink(B); InitLink(C);
	CreatLink(A); DispLink(A,'A');
	printf("表A排序后"); SortLink(A); DispLink(A, 'A');
	printf("\n");
	CreatLink(B); DispLink(B, 'B');
	printf("表B排序后"); SortLink(B); DispLink(B, 'B');
	printf("\n");
	Merge(A, B, C); printf("表A与表B合并后"); DispLink(C, 'C');
	system("pause");
	return 0;
}

//初始化链表集合:
void InitLink(LinkList &L) {
	L.data = '0';
	L.next = NULL;
	return;
}

//插入元素:直接尾插法插入集合,tail是上一次记录的为指针位置
void InsertLink(LinkList *tail, LinkList *s) {
	s->next = tail->next;
	tail->next = s;
	tail = s;
	return;
}

//判断集合元素个数
int LengthLink(LinkList &L) {
	int len = 0;
	LinkList *p = (&L)->next;
	while (p != NULL) {
		p = p->next;
		len++;
	}
	return len;
}

//创建一个集合元素
void CreatLink(LinkList &L) {
	int i, n;
	LinkList *temp, *tail = (&L);
	printf("请输入集合元素个数:");
	scanf_s("%d", &n);
	printf("请输入集合中的元素:\n");
	for (i = 1; i <= n; i++) {
		temp = (LinkList*)malloc(sizeof(LinkList));
		cin >> (temp->data);
		InsertLink(tail, temp);
	}
	return;
}

//输出集合元素
void DispLink(LinkList &L, char c) {
	LinkList *p = (&L)->next;
	if (p == NULL)
		printf("集合%c为空集合!", c);
	else {
		printf("集合%c为:", c);
		while (p != NULL) {
			printf("%c   ", p->data);
			p = p->next;
		}
	}
	printf("\n");
	return;
}

//将集合排序
void SortLink(LinkList &L) {
	LinkList *pre = &L, *p, *q, *temp;
	if (!(&L)->next) return;
	p = pre->next->next;
	pre->next->next = NULL;
	while (p != NULL) {
		q = p->next;
		pre = &L;
		while (pre->next != NULL&&pre->next->data < p->data)
			pre = pre->next;
		p->next = pre->next;
		pre->next = p;
		p = q;
	}
	return;
}

//顺序线性表合并
void Merge(LinkList A, LinkList B, LinkList &Temp) {
	int lenA, lenB;
	LinkList *pa, *pb, TempA/*较短的集合*/, TempB/*较长的集合*/, *temp;
	lenA = LengthLink(A); lenB = LengthLink(B);
	if (lenA == 0 && lenB == 0) { Temp = A; return; }
	else if (lenA != 0 && lenB == 0) {
		Temp = A; return;
	}
	else if (lenA == 0 && lenB != 0) {
		Temp = B; return;
	}
	if (lenA>lenB) {		//pa指向较小的集合，pb指向较大的集合
		TempA = B; TempB = A; pa = (&TempA); pb = (&TempB)->next;		//将集合较小的赋给集合TempA,较长的集合放入TempB
	}
	else {
		TempA = A; TempB = B; pa = (&TempA); pb = (&TempB)->next;
	}
	while (pa != NULL&&pb != NULL) {
		if (pa->next != NULL&&pa->next->data == pb->data) {		//去除相同的元素
			pa = pa->next;
			pb = pb->next;
			continue;
		}
		while (pa->next != NULL && pa->next->data < pb->data)
			pa = pa->next;		//移动之后又出现了可能相同的情况，要重新再比较一次
		if (pa->next != NULL&&pa->next->data == pb->data) {		//去除相同的元素
			pa = pa->next;
			pb = pb->next;
			continue;
		}
		temp = pb;		//先将原始pb的位置记录下来，否则链接之后将找不到原始pb的下一位置
		pb = pb->next;		//先移动pb，用temp代替原始pb进行操作
		temp->next = pa->next;
		pa->next = temp;
		pa = pa->next;
	}
	if (pa != (&TempA) && pb != NULL)
		pa->next = pa ? pa : pb;
	Temp = TempA;
	return;
}