线性表的第一位是1,是1,是1!!!!!
定义线性表类模板
const int MaxSize = 100;
template <class DataType>
class SeqList
{
public:
SeqList() { length = 0; } //构造函数初始化
SeqList(DataType a[], int n); //拷贝构造
~SeqList() {}
int Length() { return length; }
DataType Get(int i);
int Locate(DataType x);
void Insert(int i, DataType x);
DataType Delete(int i);
void PrintList();
private:
DataType data[MaxSize];
int length;
};
函数实现
template <class DataType>
SeqList<DataType>::SeqList(DataType a[], int n)
{
if (n > MaxSize) {
cout << "太长啦!!!" << endl;
return;
}
for (int i = 0; i < n; i++)
data[i] = a[i];
length = n;
}
template <class DataType>
DataType SeqList<DataType>::Get(int i)
{
if (i<1 && i>length) {
cout << "位置错误";
return 99999;
}
else return data[i - 1];
}
template <class DataType>
int SeqList<DataType>::Locate(DataType x)
{
for (int i = 0; i < length; i++)
if (data[i] == x) return i + 1;
return 0;
}
template <class DataType>
void SeqList<DataType>::Insert(int i, DataType x)
{
if (length >= MaxSize) {
cout << "超长了!!!" << endl;
return;
}
if (i<1 || i>length + 1) cout<< "无效位置"<<endl;
for (int j = length; j >= i; j--)//都往后窜
data[j] = data[j - 1];
data[i - 1] = x;
length++;
}
template <class DataType>
DataType SeqList<DataType>::Delete(int i)
{
int x;
if (length == 0) {
cout << "已经是空啦!!" << endl;
return 99999;
}
if (i<1 || i>length) {
cout << "删除位置不对" << endl;
return 99999;
}
x = data[i - 1];
for (int j = i; j < length; j++)//都往前窜
data[j - 1] = data[j];
length--;
return x;
}
template <class DataType>
void SeqList<DataType>::PrintList()
{
for (int i = 0; i < length; i++)
cout << data[i] << endl;
}
测试
int main()
{
SeqList<int> p;
p.Insert(1, 5);
p.Insert(2, 9);
cout << "打印:" << endl;;
p.PrintList();
cout << endl;
p.Insert(2, 3);
cout <<"长度为:"<< p.Length() << endl;
cout << "打印:"<<endl;;
p.PrintList();
cout << endl;
cout <<"第三个位置的元素"<< p.Get(3) << endl;
p.Delete(2);
cout << "删除2号位置的元素 打印:" << endl;;
p.PrintList();
return 0;
}