顺序表相关操作

//lzj
#include<stdio.h>
typedef struct{
	int *elem;
	int length;
}sqlist;
int initlist(sqlist &L)  //顺序表初始化 
{
	L.elem=new int[10000];
	if(!L.elem) return 0;
	L.length=0;
	return 1;
}
int getelem(sqlist L,int i,int e) //顺序表取值 
{
	if(i<1||i>L.length) return 0;
	e=L.elem[i-1];
	return 1;
} 
int locateelem(sqlist L,int e)  //顺序表查找 
{
	for(int i=0;i<L.length;i++)
	{
		if(L.elem[i]==e) return i+1;
	}
	return 0;
}
int listinsert(sqlist &L,int i,int e) //顺序表插入 
{
	if(i<1&&i>L.length+1) return 0;
	for(int j=L.length;j>=i;j--)
		L.elem[j]=L.elem[j-1];
	L.elem[i-1]=e;
	L.length++;
	return 1;
}
int deletlist(sqlist &L,int i)     //顺序表的删除 
{
	if(i<1||i>L.length) return 0;
	for(int j=i-1;j<L.length-1;j++) L.elem[j]=L.elem[j+1];
	L.length--;
	return 1;
}
int main()
{
	sqlist mylist;
	initlist(mylist);    //初始化值 
	int t;
	while(~scanf("%d",&t)&&t!=0) listinsert(mylist,mylist.length+1,t);    //插入值 
	for(int i=0;i<mylist.length;i++) printf("%d ",mylist.elem[i]);
	printf("\n"); 
	int n;
	scanf("%d",&n);  
	printf("%d\n",locateelem(mylist,n));   //顺序表查找 
	int m;
	scanf("%d",&m);
	deletlist(mylist,m);   //顺序表删除 
	for(int i=0;i<mylist.length;i++) printf("%d ",mylist.elem[i]);
	return 0;
}