2.19.txt

数据结构实验 如下： Status Fibonacci(int k, int m, int &f) /* 求k阶斐波那契序列的第m项的值f */

void DeleteSome(LinkList &L, ElemType mink, ElemType maxk)
/* Delete all the elements which value is between mink and  */
/* maxk from the single sorted LinkList with head pointer L.*/
{
    LNode * p,*q,*prep;
    p=L;
    while(p&&p->data<=mink) {
      prep=p;
      p=p->next;
    }
    while(p&&p->data<maxk){
       q=p;p=p->next;
       free(q);
    }
    prep->next=p;
}