/*
13.设计一个算法实现在带头结点的单向链表中
删除给定值的结点。(链表中的数据元素值均不相同)
*/
# include <iostream>
# include <stdio.h>
# include <stdlib.h>
using namespace std;
typedef struct Node
{
int elem;
struct Node* next;
}*linklist;
void inlinklist(linklist &l, int n)
{
l = (linklist) malloc (sizeof(Node));
l->next = NULL;
linklist end, p;
end = l;
printf("请输入链表中的元素:\n");
for(int i = 0; i<n; i++)
{
p = (linklist) malloc (sizeof(Node));
scanf("%d", &p->elem);
end->next = p;
p->next = NULL;
end = p;
}
}
void outlinklist(linklist l)
{
printf("链表中的元素为:\n");
linklist p;
p = l->next;
while(p)
{
printf("%d ", p->elem);
p = p->next;
}
printf("\n");
}
void deletelinklist(linklist &l, int x)
{
linklist p, s;
p = s = l;
while(p->elem != x)
{
s = p;
p = p->next;
}
//执行结果是p指向p->elem = x;s指向目标节点的前一个节点
if(p)
{
s->next = p->next;
free(p);
}
}
int main()
{
linklist l;
int n, m;
printf("请输入链表的元素个数:\n");
scanf("%d", &n);
inlinklist(l, n);
printf("请输入要删除的值m:\n");
scanf("%d", &m);
deletelinklist(l, m);
outlinklist(l);
return 0;
}