答:
帮你简单改了下，注意几个小问题
1.maxSize未赋值导致数组空间的大小不确定，修改后
2.cout<<"定位成功!"<<endl;//endl本身就有换行的意思了，记得加<<
3.此外还有一些单词拼写错误，比如true；以及语法错误
完整代码如下：
#include<iostream>
using namespace std;
//定义线性表类型List
template <class T>
class List
{
void clear(); //清除表
bool insert(const int p, const T value); //插入表元
bool delete1(const int p); //删除表元
bool getPos(int &p, const T value); //查表元（返回位置）
bool getValue(const int p, T &value); //读表元（返回值）
bool setValue(const int p, const T value); //修改表元
int length(T &value); //求表长
void display(); //显示表
bool append(const T value); //追加表元
};
//定义顺序表类型arrList
template <class T>
class arrList : public List<T>
{
private:
T* aList; //顺序表的指针
int maxSize; //顺序表的最大长度
int curLen; //顺序表实例的实际长度
int position; //当前读写位置
public:
//构造函数创建一个空顺序表
arrList(const int lsize)
{
aList = new T[lsize]; //开辟存储空间
maxSize = lsize;
curLen = position = 0;
}
//析构函数销毁顺序表
~arrList()
{
delete[] aList; //释放存储空间
}
//清除表
bool clear()
{
curLen = position = 0;
return true;
}
//显示表
bool display()
{
if (curLen == 0)
{
cout << "空表！\n" ;
return true;
}
for (int i = 0; i < curLen; i++) cout << aList[i] << " ";
cout << endl;
return true;
}
//求表长
bool length(int& length)
{
length=curLen;
return true;
}
//追加表元
bool append(const T value)
{
if (curLen == maxSize) //表满则自动扩大空间
{
T *pt1=aList;
aList=new T[maxSize+5];
for(int i=0; i<maxSize; i++) aList[i]=pt1[i];
maxSize=maxSize+5;
delete[] pt1;
}
aList[curLen] = value;
curLen++;
return true;
}
//插入表元
bool insert(const int p, const T value)
{
int i;
if (curLen >= maxSize)
{
cout << "The list is overflow" << endl;
return false;
}
if (p<0 || p>curLen)
{
cout << "Insertion point is illegal" << endl;
return false;
}
for (i = curLen; i > p; i--)
aList[i] = aList[i - 1];
aList[p] = value;
curLen++;
return true;
}
//删除表元
bool delete1(const int p)
{
int i;
if(curLen <= 0)
{
cout<<"无要素可删除"<<endl;
return false;
}
if(p < 0 || p > curLen-1)
{
cout<<"删除位置不合法"<<endl;
return false;
}
for(i = p; i < curLen-1; i++)
{
aList[i] = aList[i+1];
curLen--;
return true;
}
}
//查找表元
bool getValue(const int p, T &value)
{
if( curLen <= p )
{
cout << "无元素可查找" << endl;
return false;
}
value = aList[ p ];
return true;
if(curLen<=p)
cout<<"无元素可修改"<<endl;
return false;
aList[p]=value;
return true;
}
//修改
bool setValue(const int p, const T value)
{
if (curLen>=maxSize)
{
cout << "修改失败！\n" << endl;
return false;
}
if(curLen < p || p<0)
{
cout<<"无元素可修改"<<endl;
return false;
}
aList[p] = value;
return true;
}
//定位
bool getPos(int &p, const T value)
{
for(int i = 0; i < curLen; i++)
{
if(value == aList[i])
{
p = i;
break;
}
if(i < curLen)
return true;
else
return false;
}
}
};
int main()
{
arrList<int> AL(5); //定义及构造顺序表对象
int choice, p, value;
bool ok;
do
{
cout<<"顺序表程序，请选择(0退出,1清除,2显示,3表长,4插入,5追加,6删除,7查找,8修改,9定位):";
cin>>choice;
switch (choice)
{
case 0:
cout<<"再见!\n";
break;
case 1:
ok=AL.clear();
if(ok==false) cout<<"清除操作失败!\n";
else cout<<"清除操作成功!\n";
break;
case 2:
ok=AL.display();
if(ok==false) cout<<"显示操作失败!\n";
else cout<<"显示操作成功!\n";
break;
case 3:
ok=AL.length(p);
if(ok==false) cout<<"求表长操作失败!\n";
else cout<<"求表长操作成功!\n表长为:"<<p<<endl;
break;
case 4:
cout<<"插入位置，插入元素:";
cin>>p>>value;
ok = AL.insert(p,value);
if(ok==false)
cout<<"插入失败!\n"<<endl;
else
cout<<"插入成功!\n"<<endl;
break;
case 5:
cout<<"元素:";
cin>>value;
ok=AL.append(value);
if(ok==true) cout<<"追加操作成功!\n";
else cout<<"追加操作失败!\n";
break;
case 6:
cout<<"删除位置:";
cin>>p;
ok=AL.append(p);
if(ok==true)
cout<<"删除成功!\n"<<endl;
else
cout<<"删除失败!\n"<<endl;
break;
case 7:
cout<<"查找位置，查找元素:";
cin>>p>>value;
ok = AL.setValue(p,value);
if(ok==true)
cout<<"查找成功!\n"<<endl;
else
cout<<"查找失败!\n"<<endl;
break;
case 8:
cout<<"修改位置，修改内容";
cin>>p>>value;
ok=AL.setValue(p,value);
if(ok==true)
cout<<"修改成功!\n"<<endl;
else
cout<<"修改失败!\n"<<endl;
break;
case 9:
cout<<"位置，元素";
cin>>p>>value;
ok=AL.append(value);
if(ok==true)
cout<<"定位成功!\n"<<endl;
else
cout<<"定位失败!\n"<<endl;
break;
default:
cout<<"选择错误";
}
}
while(choice != 0);
return 0;
}
关注
)
