#include <stdio.h>
#include <stdlib.h>
#define LIST_MAX_SIZE 105
#define LIST_SIZE_OFFSET 5
typedef struct sqlist
{
int *elem;
int listlen;
int listsize;
}sqlist;
//初始化一张顺序表
int initlist(sqlist *s)
{
s->elem = (int *)malloc(sizeof(int) * LIST_MAX_SIZE);
if(NULL == s->elem)
{
printf("initlist malloc error \n");
return 0;
}
s->listsize = LIST_MAX_SIZE;
s->listlen = 0;
return 1;
}
//插入一个数据 1:空表 2:插入的位置有元素 3.插入时 位置不够
int listinsert(sqlist *s,int pos,int e)
{
int i = 0;
if(s->listlen >= s->listsize)
{
s->elem = (int *)realloc(s->elem,sizeof(int)* (s->listsize + LIST_SIZE_OFFSET));
if(NULL == s->elem)
{
printf("listinsert realloc error \n");
return 0;
}
s->listsize += LIST_SIZE_OFFSET;
}
for(i = s->listlen - 1;i >= pos - 1;i--)
{
s->elem[i+1] = s->elem[i];
}
s->elem[pos-1] = e;
s->listlen++;
return 1;
}
//遍历
void listprintf(sqlist s)
{
int i = 0;
while(i < s.listlen)
{
printf("%d \n",s.elem[i]);
i++;
}
}
//删除
int listdel(sqlist *s,int pos)
{
int i;
printf("s->elem = %d\n",s->elem[pos-1]);
if(pos > s->listlen)
{
printf("error input \n");
return 0;
}
for(i = pos - 1;i < s->listlen - 1;i++)
{
s->elem[i] = s->elem[i+1];
}
s->listlen--;
return 0;
}
//返回元素所在位置,不存在返回-1
int listlocate(sqlist s,int e)
{
int i = 0;
while(s.elem[i] != e && i < s.listlen )
{
i++;
}
if(s.elem[i] == e)
{
return i+1;
}
else
{
printf("find error\n");
}
return 0;
}
main()
{
int res = -1;
sqlist sq;
res = initlist(&sq);
if(0 == res)
{
return 0;
}
listinsert(&sq,1,1);
listinsert(&sq,2,2);
listinsert(&sq,3,5);
listprintf(sq);
printf("res = %d",listlocate(sq, 5));
return 1;
}