typedef struct {
int *elem;
int length;
}Sqlist;
int InitList(Sqlist &L){
L.elem=new int [100];
if(!L.elem) return 0;
L.length=0;
return 1;
}
int Getelemt(Sqlist L,int i,int &e){
e=L.elem[i-1];
return 1;
}
int Searchelemt(Sqlist L,int e){
for(int i=0;i<L.length;i++){
if(L.elem[i]==e) return i+1;
}
return 0;
}
int InsertList(Sqlist &L,int position ,int e){
if(position<1||position>L.length){
return 0;
}else{
for(int i=L.length+1;i>position-1;i--){
L.elem[i]=L.elem[i-1];
}
L.elem[position-1]=e;
L.length++;
return 1;
}
}
int DeleteList(Sqlist & L,int position){
if(position<1||position>L.length){
return 0;
}else{
for(int i=position-1;i<L.length;i++){
L.elem[i]=L.elem[i+1];
}
L.length--;
return 1;
}
简单数据结构的顺序表实现,比较简单,很容易理解。