C/C++线性表顺序存储

大二下学期，终于开始学数据结构了。

对c和c++的知识掌握烂的一塌糊涂，但从线性表开始慢慢实现吧，这也是对c语言的熟悉与掌握

// ConsoleApplication3.cpp : 定义控制台应用程序的入口点。
//





//使用前需要在d盘根目录建立data与data1为名的文档，输入整形数据，以空格隔开；开始的选择2“输入数组”只支持五个数据元素输入。

//具体实现了线性表的初始化，元素位置返回，元素插入、删除与线性表合并。





#include "stdafx.h"
#include<iostream>
#include<fstream>


#define error -1;
#define OK 1;
#define true 1;
#define false -1;
using namespace std;


const int MaxSize = 100;//数组最大长度
typedef int Status;
typedef int ElemType;
typedef struct
{
	ElemType data[MaxSize];
	int length;
}SqList;

//线性表初始化
void Init(SqList *&L){
	int checknum;
	int iarrylength;
	int i = 0;
	int n;
	cout << "请选择：\n输入数字1：读取d盘data.txt文件；\n输入数字2：请键入数据元素进入数组。\n";
	cout << "选择为：";
	cin >> checknum;
	if (checknum == 1)
	{
		ifstream infile("d:\\data.txt", ios::in);
		if (!infile)
		{
			cerr << "文件未被成功打开！\n";
			return;
		}
		cout << "请输入您想要的线性表长度：";
		cin >> n;
		while (infile >> iarrylength)
		{
			L->data[i++] = iarrylength;
			if (i == MaxSize)
			{
				cout << "空间不够！" << endl;
				break;
			}
			if (i + 1 > n)
			{
				break;
			}
		}
		if (i <= MaxSize)        
		{
			L->length = i;
		}
		else
		{
			L->length = MaxSize;
			infile.close();
		}
	}
	else if (checknum == 2)     //2:输入数组元素
	{
		int ai = 0;
		int alength;
		for (; ai <5; ai++)
		{
			cin >> alength;
			L->data[ai] = alength;
			L->length = ai+1;
		}
		for (int ai = 0; ai < L->length; ai++)
		{
			cout << L->data[ai]<<" "<<endl;
		}
		
	}
}

//线性表返回元素地址
Status GetElement(SqList *&L, int i,ElemType e)
{
	cout << "请输入您想查找的元素的位置： ";
	cin >> i;
	if (L->length == 0 || i<1 || i>L->length)
	{
		return error;
	}
	else
	{
		e = L->data[i - 1];
		cout <<"第"<<i<<"个元素是"<< e << endl;
		return OK;
	}
}

//线性表插入元素
Status InsertList(SqList *&L, int i, ElemType e)
{
	int k;
	cout << "请输入你要插入的元素：";
	cin >> e;
	cout << "请输入你要插入的元素位置：" << endl;
	cin >> i;
	if (i< 1 || L->length == MaxSize||i>=L->length+1)
	{
		return error;
	}
	else
	{
		for (k = L->length - 1; k>=i - 1; k--)
		{
			L->data[k + 1] = L->data[k];
		}
		L->data[i-1] = e;
		L->length++;
		return OK;
	}
}

//线性表删除元素
Status DeleteList(SqList *&L, int i, ElemType e)
{
	int k;
	cout << "请输入您要删除的数的位置： ";
	cin >> i;
	if (L->length == 0)
	{
		return error;
	}
	else if (i<1 || i>L->length)
	{
		cout << "Error." << endl;
		return error;
	}
	else
	{
		for (k = i; k < L->length; k++)
		{
			L->data[k-1] = L->data[k];
		}
		L->length--;
		return OK;
	}
}

//线性表合并
void MergeList(SqList *&L, SqList *&LB, SqList *&LC)
{
	int i = 0;
	int n;
	int iarrylength;
	ifstream infile1("d:\\data1.txt", ios::in);
	if (!infile1)
	{
		cerr << "文件未被成功打开！\n";
		return;
	}
	cout << "请输入您想要的线性表B的长度：";
	cin >> n;
	while (infile1 >> iarrylength)
	{
		LB->data[i++] = iarrylength;
		if (i == MaxSize)
		{
			cout << "空间不够！" << endl;
			break;
		}
		if (i + 1 > n)
		{
			break;
		}
	}
	if (i <= MaxSize)
	{
		LB->length = i + 1;
		for (int j = 0; j < LB->length - 1; j++)		//输出表b的数据元素
		{
			cout << LB->data[j]<<" ";
		}
	}
	else
	{
		LB->length = MaxSize;
		infile1.close();
	}
	cout << endl;


	//实现AB表合并


	int nummemo1 = 0, nummemo2 = 0;//计数器
	int o = 0;//LC表计数器
	while (nummemo1 < L->length&&nummemo2 < LB->length)
	{
		if (L->data[nummemo1] < LB->data[nummemo2])
		{
			LC->data[o] = L->data[nummemo1];
			o++;
			nummemo1++;
		}
		else 
		{
			LC->data[o] = LB->data[nummemo2];
			o++;
			nummemo2++;
		}

	}
	LC->length = L->length + LB->length;
	cout << "合并线性表LC为：";
	
	for (int j = 0; j < LC->length - 2; j++)
	{
		cout << LC->data[j]<< " ";
	}
	cout << endl;
}


//打印线性表

void ShowList(SqList *&L)
{
	int i;
	for (i = 0; i < L->length; i++)
	{
		cout << L->data[i] << " ";
	}
	cout << endl;
}

//main入口
int _tmain(int argc, _TCHAR* argv[])
{
	SqList *L = new SqList;
	SqList *LB = new SqList;
	SqList *LC = new SqList;
	int i=0;
	ElemType e=0;
	Init(L);
	GetElement(L,i,e);
	ShowList(L);
	InsertList(L, i, e);
	ShowList(L);
	DeleteList(L, i, e);
	ShowList(L);
	MergeList(L, LB, LC);
	system("pause");
	return 0;
}