#include<iostream>
#include"LinList.h"
#include<stdlib.h>
using namespace std;
template<class T>
void Merge(LinList<T> LA, LinList<T> LB, LinList<T>& LC)
{
T x;
LC = LA;
for (int j = 0; j < LB.Size(); j++)
{
x = LB.GetData(j);
LC.OrderInsert(x);
}
}
int main()
{
LinList<int> mylistA, mylistB, mylistC;
int x;
int temp;
cout << "创建单链表A" << endl;
cout << "请输入:（输入零停止）";
cin >> x;
while (x != 0)
{
mylistA.OrderInsert(x);
cout << "请输入:（输入零停止）";
cin >> x;
}
cout << "创建单链表B" << endl;
cout << "请输入:（输入零停止）";
cin >> x;
while (x != 0)
{
mylistB.OrderInsert(x);
cout << "请输入:（输入零停止）";
cin >> x;
}
cout << "单链表A:";
for (int i = 0; i < mylistA.Size(); i++)
cout << mylistA.GetData(i) << " ";
cout << "单链表B:";
for (int i = 0; i < mylistB.Size(); i++)
cout << mylistB.GetData(i) << " ";
Merge<int>(mylistA, mylistB, mylistC);
cout << "合并后的单链表C:";
for (int i = 0; i < mylistC.Size(); i++)
cout << mylistC.GetData(i) << " ";
system("pause");
return 0;
}
一算法可实现两个非递减的线性表的合并，采用链式存储结构，能够输出合并前和合并后链表的内容
需积分: 0 134 浏览量
2023-09-12
07:33:23
上传
评论 1
收藏 13.07MB ZIP 举报
数据结构与算法 线性表实验代码.zip （24个子文件） 
Project1 
LinList.h 3KB .vs Project1 v16 Browse.VC.db 5.2MB .suo 36KB ipch AutoPCH 90576d33e25601fe SEQLIST.ipch 30.69MB 8eb888622470f6cb MAIN.ipch 30.69MB Project1.sln 1KB Project1.vcxproj 6KB Project1.vcxproj.user 168B Project1.vcxproj.filters 1KB Debug Project1.tlog CL.write.1.tlog 484B CL.command.1.tlog 654B link.command.1.tlog 1KB link.read.1.tlog 4KB link.write.1.tlog 516B Project1.lastbuildstate 232B CL.read.1.tlog 18KB vc142.idb 147KB Project1.pdb 500KB vc142.pdb 396KB Project1.ilk 437KB
Project1.exe 57KB Project1.log 256B Main.obj 77KB Main.cpp 1KB资源评论
