顺序表

用C++实现顺序表

SeqList.cpp

const int MaxSize = 50;
template<class T>
class SeqList
{
public:
	SeqList() { length = 0; }
	SeqList(T a[], int n);
	~SeqList();
	int Length() { return length; }
	void Insert(int i, T x);
	T GetW(int i);
	int GetZ(T x);
	T Delete(int i);
	void Print();
private:
	T data[MaxSize];
	int length;
};

SeqList.cpp

template<class T>
SeqList<T>::SeqList(T a[], int n)
{
	
	if (n > MaxSize)throw "上溢";
	for (int j = 0; j < n; j++)
		data[j] = a[j];
	length = n;
}


template<class T>
void SeqList<T>::Insert(int i, T x)
{
	int j;
	if (i >= MaxSize)throw "上溢";
	if (i<1 || i>length + 1)throw "上溢";
	for (j = length; j>= i; j--)
		data[j] = data[j - 1];
	data[i - 1] = x;
	length++;
}

 
template<class T>
T SeqList<T>::GetW(int i)
{
	if (i<1 || i>length)throw "位置";
	else return data[i - 1];
}


template<class T>
int SeqList<T>::GetZ(T x)
{
	for (int i = 0; i < length; i++)
	{
		if (data[i] == x)
			return i + 1;
	}
	return 0;
}


template<class T>
T SeqList<T>::Delete(int i)
{
	T x;
	if (length == 0) throw "下溢";
	if (i > length || i < 1)throw "位置";
	x = data[i - 1];
	int j;
	for (j = i - 1; j < length; j++)
		data[j] = data[j + 1];
	   length--;
	return x;
}


template<class T>
void SeqList<T>::Print()
{
	for (int i = 0; i < length; i++)
		cout << data[i];
}

template<class T>
SeqList<T>::~SeqList()
{

}

SeqListMain.cpp

#include <iostream>       
#include "SeqList.cpp"     
using namespace std;
int main()
{
	SeqList<int> a;         
	cout << "执行插入操作:" << endl;
	try
	{
		a.Insert(1, 1);
		a.Insert(2, 3);
		a.Insert(3, 4);
	}
	catch (char* wrong)
	{
		cout << wrong;     //如失败提示失败信息
	}
	cout << "已经插入“1，3，4”" << endl;
	cout << endl;
	cout << "顺序表a的长度为:";
	cout << a.Length() << endl;         //返回单链表长度
	cout << endl;
	cout << "按位查询第二个元素:" << endl;
	cout << "第二个元素为:";
	cout << a.GetW(2) << endl;          //查找顺序表中第二个元素
	cout << endl;
	cout << "按值查询3:" << endl;
	cout << "值为3的元素位置为:";
	cout << a.GetZ(3) << endl;        //查找元素3，并返回在单链表中位置
	cout << endl;
	//system("pause");
	try
	{
		if (a.Length()) {
			cout << "执行删除第一个元素操作:" << endl;
			cout << endl;
			a.Delete(1);                //删除元素1
			cout << "已删除成功，顺序表a的长度为:";
			cout << a.Length() << endl;
		}

		else {
			cout << "顺序表a长度为0" << endl;
		}
	}
	catch (char* wrong)
	{
		cout << wrong;     //如失败提示失败信息
	}
	cout << endl;
	cout << "顺序表a中的元素有:" << endl;
	a.Print();              //输出所有元素

	int r[] = { 1,2,3,4,5 };
	SeqList <int> b(r, 5);     //根据数组创建顺序表
	cout << "执行插入操作前顺序表b为:" << endl;
	b.Print();            //输出顺序表所有元素
	cout << "插入前顺序表b的长度为:";
	cout << b.Length() << endl;
	try
	{
		b.Insert(3, 8);
	}
	catch (char* wrong)
	{
		cout << wrong;     //如失败提示失败信息
	}
	cout << "执行插入操作后顺序表b为:" << endl;
	b.Print();            //输出顺序表b所有元素
	cout << "插入后顺序表b的长度为:";
	cout << b.Length() << endl;
	cout << endl;
	try
	{
		if (a.Length()) {
			cout << "执行删除第一个元素操作:" << endl;
			cout << endl;
			b.Delete(1);                //删除b中第一个元素
			cout << "已删除成功，顺序表b的长度为:";
			cout << b.Length() << endl;
		}

		else {
			cout << "顺序表b长度为0" << endl;
		}
	}
	catch (char* wrong)
	{
		cout << wrong;     //如失败提示失败信息
	}
	cout << "执行插入操作后顺序表b为:" << endl;
	b.Print();            //输出顺序表所有元素
}