俩个有序链表并为一个有序链表
LinkList Union(LinkList &A,LinkList& B, LinkList& C)//链表的合并函数
{
LinkList a, b,c;
a = A->next;
b = B->next;
c=C;
while (a && b)
{
if (a->data >= b->data) {
c->next = b;
c = b;
b = b->next;
}
else {
c->next = a;
c = a;
a = a->next;
}
}
c->next = a ? a : b;
free(B);
return C;
}
运行总代码:
#include<iostream>//ZJJ数据据结构-单链表2.11
using namespace std;
typedef struct Node//结点结构体
{
int data;//数据域
struct Node* next;//指针域
}Node, * LinkList;
Node* CreatNode(int data) {
Node* node = (Node*)malloc(sizeof(Node));
node->next=NULL;
node->data = data;
return node;
}
LinkList CreatListHead(LinkList &L)//1.链表的创建(头插法)
{
int data;
cin >> data;
L= CreatNode(NULL);
while (data != 999)
{
Node* node = CreatNode(data);
node->next = L->next;
L->next = node;
cin >> data;
}
return L;
}
LinkList CreatListTail(LinkList& L)//1.链表的创建(尾插法)
{
int data;
cin >> data;
L = CreatNode(NULL);
Node* s;
s = L;
while (data != 999)
{
Node* node = CreatNode(data);
s->next = node;
s = node;
cin >> data;
}
s->next = NULL;
return L;
}
LinkList Union(LinkList &A,LinkList& B, LinkList& C)//链表的合并函数
{
LinkList a, b,c;
a = A->next;
b = B->next;
c=C;
while (a && b)
{
if (a->data >= b->data) {
c->next = b;
c = b;
b = b->next;
}
else {
c->next = a;
c = a;
a = a->next;
}
}
c->next = a ? a : b;
free(B);
return C;
}
void PrintList(LinkList L)
{
LinkList p = L->next;
cout << "链表元素如下" << endl;
while (p != NULL)
{
cout << p->data << endl;
p = p->next;
}
}
int main()
{
LinkList L, N;
cout << "头插法建立单链表,输入值(999结束)" << endl;
L = CreatListHead(L);
PrintList(L);
cout << "尾插法建立单链表,输入值(999结束)" << endl;
N = CreatListTail(N);
PrintList(N);
LinkList M = (Node*)malloc(sizeof(Node));
M=Union(L, N, M);
PrintList(M);
system("pause");
return 0;
}
运行结果:
有无欠缺的,欢迎指正。