顺序表的实现.cpp

顺序表的实现.cpp如果开发者对于本文件有需要的可以参考。
#include
#include
using namespace std;
const int Maxsize = 100;
template
class SeqList
{
public:
SeqList();
SeqList(DataType a[], int n);
~SeqList();
int Length();
DataType Get(int i);
int Locate(DataType x);
void Insert(int i, DataType x);
DataType Delete(int i);
int Empty;
void PrintList();
private:
DataType data[Maxsize];
int length;
};
template
SeqList::~SeqList() {
length = 0;
}
template
SeqList::SeqList(DataType a[], int n)
{
if (n > Maxsize)throw"参数非法";
for (int i = 0; i < n; i )
{
data[i] = a[i];
}
length = n;
}
template
int SeqList::Length() {
return length;
}
template
int SeqList::Locate(DataType x)
{
for (int i = 0; i < length; i )
{
if (data[i] == x)
{
return i 1;
}
}
return 0;
}
template
void SeqList::PrintList()
{
for (int i = 0; i < length; i )
{
cout << data[i] << "\t";
}
cout << endl;
}
template
DataType SeqList::Get(int i)
{
if (i<1 || i>length)throw"查找位置非法";
else
return data[i - 1];
}
template
void SeqList::Insert(int i, DataType x)
{
if (length == Maxsize)throw"上溢";
if (i<1 || i>length 1)throw"插入位置错误";
for (int j = length; j >= i; j--) {
data[j] = data[j - 1];
}
data[i - 1] = x;
length ;
}
template
DataType SeqList::Delete(int i)
{
DataType x;
if (length == 0)throw"下溢";
if (i<1 || i>length)throw"删除位置错误";
x = data[i - 1];
for (int j = i; j < length; j )
data[j - 1] = data[j];
length--;
return x;
}
using namespace std;
int main() {
int a[Maxsize];
for (int i = 0; i < Maxsize; i )
{
a[i] = rand() % 100 1;
}
SeqListL{ a,10 };
cout << "当前线性表的数据为：";
L.PrintList();
int b;
cout << "请输入需要查找的元素" << endl;
cin >> b;
int c = L.Locate(b);
if (c != 0)
{
cout << "该元素在第" << c << "个位置" << endl;
}
else
{
cout << "该元素不在当前线性表中" << endl;
}
cout << "请输入要插入的元数:" << endl;
int data;
cin >> data;
cout << "请输入要插入的位置:" << endl;
cin >> b;
L.Insert(b, data);
L.PrintList();
cout << "请输入需要删除的元素的位置:" << endl;
cin >> b;
L.Delete(b);
L.PrintList();
system("pause");
}