#include<stdio.h>
#include<stdlib.h>
/*
* 设一个带头结点的单链表中所有元素结点的数据无序,编写一个函数,输出表中所有
* 介于给定的两个值之间的元素
*/
typedef struct LNode {
int data;
struct LNode* next;
}LNode,*LinkList;
LinkList CreateList(LinkList& L)
{
int x;
LNode* s;
L = (LinkList)malloc(sizeof(LNode));
LNode* r = L;
scanf("%d", &x);
while (x != -1)
{
s = (LNode*)malloc(sizeof(LNode));
s->data = x;
r->next = s;
r = s;
scanf("%d", &x);
}
r->next = NULL;
return L;
}
LinkList DeleteElem(LinkList& L, int start, int end)
{
LNode* p = L->next;
LNode* pre = L;
LNode* t;
while (p)
{
if (p->data >= 4 && p->data <= 8)
{
t = p;
pre->next=p->next;
p = p->next;
free(t);
}
else
{
p = p->next;
pre = pre->next;
}
}
return L;
}
void PrintList(LinkList L)
{
L = L->next;
while (L)
{
printf("%4d", L->data);
L = L->next;
}
}
int main()
{
LinkList L;
CreateList(L);
DeleteElem(L, 4, 8);
PrintList(L);
return 0;
}