顺序表
#include <iostream>
using namespace std;

class SeqList
{
private:
int *list;
int maxsize;
int size;
public:
SeqList(int n);
~SeqList();
int find(int pos);
void insert(int item,int pos);
void dele(int pos);
};

SeqList::SeqList(int n)
{
maxsize=n;
size=0;
}

SeqList::~SeqList()
{
delete []list;
}

int SeqList::find(int pos)
{
return list[pos-1];
}

void SeqList::insert(int item,int pos)
{
for (int j=size;j>=pos;j--)
{
list[j]=list[j-1];
}
list[pos-1]=item;
size++;
}

void SeqList::dele(int pos)
{
for (int j=pos;j<size;j++)
{
list[j-1]=list[j];
}
size--;
}
int main ()
{
int length,temp,i;
SeqList mylist(50);
cin>>length;
for (i=1;i<=length;i++)
{
cin>>temp;
mylist.insert(temp,i);
}
for (i=1;i<=length;i++)
{
cout<<mylist.find(i)<<" ";
}
cout<<endl;


return 0;
}

运行出错

[解决办法]

C/C++ code

SeqList::SeqList(int n){    maxsize=n;    size=0;    list = new int[maxsize];}