数据结构-顺序表的合并

//顺序表的长度，取第i个元素，判断有无e这个元素，把e插到最后，输出表，合并表
#include 
using namespace std;
#define max 100
#define ok 1
#define error 0

typedef struct 
{
	int *elem;
	int length;
} list;

void chuangianshunxubiao(list &l)//创建单链表 
{
	l.elem = new int[max];
	l.length = 0;
}

int changdu(list l)//求长度 
{
	return l.length;
}

void quyuansu(list l, int i, int &e)//取元素
{
	e = l.elem[i - 1];
}

bool panduan(list l, int e) 
{
	int i;
	for (i = 0; i < l.length; i++) 
	{
		if (e == l.elem[i]) 
		{
			return true;
		}
	}
	return false;
}

void zuihou(list &l, int e) 
{
	l.elem[l.length] = e;
	l.length++;
}

void print(list l) 
{
	int i;
	for (int i = 0; i < l.length; i++) 
	{
		cout << l.elem[i] << " ";
	}
	cout << endl;
}

void hebing(list &la, list lb) 
{
	//lb中的不同元素插入la。
	int temp, i;
	int lenga = changdu(la);
	int lengb = changdu(lb);
	for (i = 1; i <= lengb; i++) 
	{
		quyuansu(lb, i, temp);
		if (!panduan(la, temp)) 
		{
			zuihou(la, temp);
		}
	}

}

void shuru(list &l, int n) 
{
	int i;
	for (int i = 0; i < n; i++) 
	{
		cout << "请输入" << i + 1 << "个数" << endl;
		cin >> l.elem[i];
	}
	l.length = n;
}

int main () 
{
	list la, lb;
	int n, m;
	chuangianshunxubiao(la);
	chuangianshunxubiao(lb);
	cout << "请输入线性表la的个数" << endl;
	cin >> n;
	shuru(la, n);
	cout << "请输入线性表lb的个数" << endl;
	cin >> m;
	shuru(lb, m);
	print(la);
	print(lb);
	hebing(la, lb);
	print(la);
	return 0;
}
![在这里插入图片描述](https://img-blog.csdnimg.cn/4c3bfee8efc844b9a82894537c9e784e.png?x-oss-process=image/watermark,type_ZHJvaWRzYW5zZmFsbGJhY2s,shadow_50,text_Q1NETiBAVmlvbGV0Zmg=,size_20,color_FFFFFF,t_70,g_se,x_16#pic_center)