定义线性表结构
typedef struct SQLIST
{
int *list;
int len;
int maxlen;
}L;
创建表
L* creatlist(int maxlen)
{
L *sqlist= (L*)malloc(sizeof(L));
if (sqlist != NULL)
{
sqlist->list = (*int)malloc(sizeof(int) * maxlen);
if (sqlist->list == NULL)
return NULL;
sqlist->len = 0;
sqlist->maxlen = maxlen;
}
return sqlist;
}
插入表元素
int insert(L* sqlist, int data, int pstn)
{
if (pstn < 0 || pstn >= sqlist->maxlen || sqlist->len == sqlist->maxlen)
return -1;
for (int i = sqlist->len; i > pstn; i--)
sqlist->list[i] = sqlist->list[i - 1];
sqlist->list[pstn] = data;
return ++sqlist->len;
}
输出表元素
void print(L* sqlist)
{
for (int i = 0; i < sqlist->len; i++)
printf("%d ", sqlist->list[i]);
}
查找表元素
int search(L* sqlist,int data)
{
for (int i = 0; i < sqlist->len; i++)
{
if (sqlist->list[i] == data)
return i;
}
return -1;
}
主函数
void main()
{
int maxlen,len,pstn,data;
printf("请输入表容量:");
scanf_s("%d", &maxlen);
L* sqlist=creatlist(maxlen);
printf("请输入表长度:");
scanf_s("%d", &len);
printf("请输入表元素:");
for(int i=0;i<len;i++)
{
scanf_s("%d", &data);
insert(sqlist,data,i);
}
printf("请输入元素及插入位置:");
scanf_s("%d%d", &data,&pstn);
insert(sqlist, data, pstn);
print(sqlist);
printf("\n请输入待查找元素:");
scanf_s("%d", &data);
printf("查找结果:%d",search(sqlist,data));
}