#include<iostream>
using namespace std;
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define INFEASIBLE - 1
#define OVERFLOW - 2
#define SIZE 4
typedef int Status;
typedef struct Lnode {
int data;
struct Lnode* next;
}Lnode,*LinkList;
Status InitList(LinkList& L) {
L = new Lnode;
L->next = NULL;
return OK;
}
void CreateList_R(LinkList& L, int n) {
InitList(L);
LinkList r = L;
for (int i = 0; i < n; i++) {
LinkList p = new Lnode;
cin >> p->data;
p->next = r->next;
r->next = p;
r = p;
}
}
void MergeList(LinkList& L1, LinkList& L2, LinkList& L3) {
LinkList p1 = L1->next;
LinkList p2 = L2->next;
L3 = L1;
LinkList p3 = L3;
while (p1 && p2) {
if ((p1->data) <= (p2->data)) {
p3->next = p1;
p3 = p1;
p1 = p1->next;
}
else {
p3->next = p2;
p3 = p2;
p2 = p2->next;
}
}
p3->next = p1 ? p1 : p2;
delete L2;
}
void printList(LinkList& L) {
LinkList p = L->next;
while (p) {
cout << p->data << " ";
p = p->next;
}
}
void main() {
LinkList L1, L2, L3;
InitList(L3);
int m, n;
cout << "请输入A集合的元素个数以及元素:" << endl;
cin >> m;
CreateList_R(L1,m);
cout << "请输入B集合的元素个数以及元素:" << endl;
cin >> n;
CreateList_R(L2, n);
cout << "请按顺序合并A集合与B集合并打印合并后的C集合:" << endl;
MergeList(L1, L2, L3);
printList(L3);
}
线性有序表的合并
最新推荐文章于 2023-10-25 11:29:55 发布