bool del_s_t(LinkList& L, int s,int t)
{
LNode* pre=L, * p=L->next;
if (s > t)
return false;
while (p)
{
if (p->data>s && p->data<t)
{
pre->next = p->next;
free(p);
p = pre->next;
}
else
{
pre = pre->next;
p = p->next;
}
}
return true;
}