数据结构学习记录(1.1)

数据结构学习记录

顺序存储线性表的合并
合并成功
合并失败

#include <iostream>
using namespace std;

const int Maxlen = 6;
typedef int dataType;
struct SqList
{
	dataType data[Maxlen];
	int len;
};

//定义初始化
void initSqList(SqList* pList)
{
	//将pLIst指向的SqList类型变量的长度成员设置为0
	pList -> len = 0;
}

//定义线性表插入操作
bool insertData(SqList* pList, int index, dataType newData)
{
	if(pList ->len == Maxlen)
		return false;
	if(index < 0 || index > pList ->len)
		return false;
	for(int i = pList -> len; i >index; i--)
	{
		pList -> data[i] = pList -> data[i-1];
	}
	pList -> data[index] = newData;
	pList -> len++;
	return true;
}

//打印线性表数据
void printSqList(SqList* pList)
{
	cout<<"线性表中的数据是:";
	for (int i = 0; i < pList -> len; i++)
	{
		cout<<pList -> data[i]<<endl;
	}
	cout<<endl;
}


//线性表的合并操作
void unionList(SqList& La,SqList Lb)
{
	int e = 0;
	if (La.len + Lb.len >Maxlen)
		cout<<"合并失败!";
	else
	{
	for (int i = 0;i < Lb.len;i++)
	{
		e = Lb.data[i];
		insertData(&La,La.len,e);
	}
	cout<<"合并成功"<<endl;
	printSqList(&La);
	}
}



int main()
{
	SqList La;
	SqList Lb;
	initSqList(&La);
	initSqList(&Lb);
	insertData(&La,0,6);
	insertData(&La,1,5);
	insertData(&La,2,3);
	insertData(&La,3,3);
	insertData(&La,4,3);
	insertData(&La,5,3);
	insertData(&La,6,3);
	insertData(&La,7,3);
	insertData(&La,8,3);
	insertData(&Lb,0,10);
	insertData(&Lb,1,14);
	insertData(&Lb,2,7);
	printSqList(&La);
	printSqList(&Lb);
	unionList(La,Lb);
	system("pause");
}