Question

编程题目 给一个单链表L编写一个删除L中值为x结点的直接前驱结点的算法

Answer 1

int deletex(slink *head,ElemType x)
{ slink *p,*q;
p=head;
while(p->next->next!=NULL&&p->next->next->data!=x)
{ p=p->next;}

if(p->next==NULL) return 0;
else { q=p->next;p->next=q->next;free(q);return 1;}
}

Answer 2

Node *next;
} Node;

void delNode(Node **L, Node *x)
{
Node **pp = L;
while (pp && *pp) {
if ((*pp)->next == x) {
*pp = x->next;
delete x;
return;
}
}
}