typedef struct SLnode
{
int data;
struct SLnode* next;
}SLnode,*SLnodelist;
void printlist(SLnodelist la)
{
SLnodelist ret = la->next;
while (ret)
{
printf("%d->", ret->data);
ret = ret->next;
}
printf("NULL\n");
}
void Insertlist(SLnodelist la, int mink, int maxk)
{
SLnodelist p, q;
p = la->next;
SLnodelist pre = (SLnodelist)malloc(sizeof(SLnode));
while (p && p->data <= mink)//这里可以<=mink
{
pre = p;
p = p->next;
}
//这里pre就是mink的前一个数值,等下可以利用pre和maxk后一个数值相连接,这样就把mink和maxk的这个区域删掉
while (p && p->data < maxk)
{
q = p;
p = p->next;
free(q);//释放掉这些mink和maxk区间的元素
}
pre->next = p;
}
int main()
{
int n, mink = 0, maxk = 0;
SLnodelist la;
la = (SLnodelist)malloc(sizeof(SLnode));
la->next = NULL;
SLnodelist pa = la;
printf("请输入la链表的元素长度\n");
scanf("%d", &n);
printf("请输入la链表的元素\n");
for (int i = 0; i < n; i++)
{
SLnodelist p;
p = (SLnodelist)malloc(sizeof(SLnode));
scanf("%d", &p->data);
p->next = NULL;
pa->next = p;
pa = pa->next;
}
printf("la链表的元素为\n");
printlist(la);
printf("请输入mink和maxk的值\n");
scanf("%d%d", &mink, &maxk);
Insertlist(la, mink, maxk);
printf("除去mink和maxk区间的元素后\n");
printlist(la);
return 0;
}
![](https://i-blog.csdnimg.cn/direct/b63ad9c6cb2e4531afc93ecac1b98e3c.png)