C++ 顺序表的基本操作

前言

使用顺序表

#include<iostream>
using namespace std;
const int defaultSize = 100;
template<class T>
class SeqList
{
protected:
	T* data;
	int last;
	int maxSize;
public:
	SeqList(int sz = defaultSize);//构造函数
	SeqList(SeqList<T>& L);//复制构造函数
	~SeqList();//析构函数
	int Size()const;//计算表最大可容纳表项个数
	int Length()const;//计算当前表的长度
	int Search(T& x)const;//搜索x在表中的位置，函数返回表项序号
	int Locate(int i)const;//定位第i个表项，函数返回表项序号
	bool getData(int i,T&x)const;//取第i个表项的值
	void setData(int i, T& x);//用x修改第i个表项的值
	bool Insert(int i, T& x);//插入x在第i个表项之后
	bool Remove(int i, T& x);//删除第i个表项，通过x返回表项的值
	bool IsEmpty();//判断表是否为空
	bool Isfull();//判断表是否为满
	void input();
	void output();
};
template<class T>
SeqList<T>::SeqList(int sz)//构造函数
{
	if (sz > 0)
	{
		maxSize = sz;
		last = -1;
		data = new T[maxSize];
		if (data == NULL)
		{
			cout << "存储分配错误" << endl;
			exit(1);
		}
	}
}
template<class T>
SeqList<T>::SeqList(SeqList<T>& L)//复制构造函数
{
	maxSize = L.Size();
	last = L.length() - 1;
	T value;
	data = new T[maxSize];
	if (data == NULL)
	{
		cout << "存储分配错误" << endl;
		exit(1);
	}
	for (int i = 0; i <= last + 1; i++)
	{
		L.getData(i, value);
		data[i - 1] = value;
	}
}
template<class T>
SeqList<T>::~SeqList()
{
	delete[]data;
}
template<class T>
int SeqList<T>::Size()const
{
	return maxSize;
}
template<class T>
int SeqList<T>::Length()const
{
	return last + 1;
}
template<class T>
int SeqList<T>::Search(T &x)const
{
	for (int i = 0; i <= last; i++)
		if (data[i] == x)
			return i + 1;
	return 0;
}
template<class T>
int SeqList<T>::Locate(int i)const
{
	if (i >= 1 && i <= last + 1)
		return i;
	else
		return 0;
}
template<class T>
bool SeqList<T>::getData(int i,T&x)const
{
	if (i >= 1 && i <= last + 1)
		x = data[i - 1];
	return x;
}
template<class T>
void SeqList<T>::setData(int i, T& x)
{
	if (i >= 1 && i < last + 1)
		data[i - 1] = x;
}
template<class T>
bool SeqList<T>::Insert(int i, T& x)//插入
{
	if (i<0 || i>last + 1)
		return false;
	if (last == maxSize)
		return false;
	for (int j = last; j >= i; j--)
		data[j + 1] = data[j];
	data[i] = x;
	last++;
	return true;
}
template<class T>
bool SeqList<T>::Remove(int i, T& x)
{
	if (last == -1)
		return false;
	if (i<0 || i>last + 1)
		return false;
	x = data[i - 1];
	for (int j = i; j <= last; j++)
		data[j - 1] = data[j];
	last--;
	return true;
}
template<class T>
bool SeqList<T>::IsEmpty()
{
	return (last == -1) ? true : false;
}
template<class T>
bool SeqList<T>::Isfull()
{
	return (last == maxSize-1) ? true : false;
}
template<class T>
void SeqList<T>::input()
{
	cout << "开始建立顺序表，请输入表中元素个数：";
	while (1)
	{
		cin >> last;
		if (last <= maxSize - 1)
			break;
		cout << "个数不能超过" << maxSize - 1 << endl;
	}
	for (int i = 0; i < last; i++)
	{
		cin >> data[i];
	}
}
template<class T>
void SeqList<T>::output()
{
	cout << "顺序表最后位置元素为：" << last << endl;
	for (int i = 0; i < last; i++)
		cout <<"#"<<i+1<< ":"<<data[i] << endl;
}
int main()
{
	SeqList<int> L;
	cout << "---顺序表---" << endl;
	cout << "1.输入顺序表" << endl;
	cout << "2.表最大容纳个数" << endl;
	cout << "3.搜索元素位置" << endl;
	cout << "4.取第i个表项的值" << endl;
	cout << "5.修改" << endl;
	cout << "6.插入" << endl;
	cout << "7.删除" << endl;
	cout << "8.输出" << endl;
	cout << "-1:退出" << endl;
	cout << "---顺序表---" << endl;
	int a,i,x;
	cout << "操作：";
	cin >> a;
	while (a != -1)
	{
		switch (a)
		{
		case(1):
			L.input();
			break;
		case(2):
			cout << "个数为：";
			cout<<L.Size()<<endl;
			break;
		case(3):
			cout << "输入要搜索的值：";
			cin >> x;
			if (L.Search(x) != 0)
				cout << L.Search(x) << endl;
			else
				cout << "查无此值" << endl;
			break;
		case(4):
			cout << "取项为：";
			cin >> i;
			cout << L.getData(i, x) << endl;
			break;
		case(5):
			cout << "输入修改项：";
			cin >> i;
			cout << "输入修改项的值";
			cin >> x;
			L.setData(i, x);
			L.output();
			break;
		case(6):
			cout << "插入的值为：";
			cin >> x;
			cout << "插入的项为：";
			cin >> i;
			L.Insert(i, x);
			L.output();
			break;
		case(7):
			cout << "删除项为：";
			cin >> i;
			L.Remove(i, x);
			L.output();
			break;
		case(8):
			L.output();
			break;
		case(-1):
			exit(1);
		}
		cout << "操作：";
		cin >> a;
	}
	return 0;
}

总结

顺序表的使用时最基本的数据结果类型，后面的栈和队列可能都需要顺序表的使用。