#include

#include

typedef struct node

{

int date;

struct node *next;

}NODE;

NODE *create()

{

int a;

int n;

NODE *head;

NODE *p;

NODE *q;

head = (NODE*)malloc(sizeof(NODE));

q = head;

printf("\n输入单链表的长度值 n:\n");

scanf("%d",&n);

if(n > 0)

{

printf("输入单链表的(%d) 个元素",n);

while(n > 0)

{

scanf("%d",&a);

p = (NODE*)malloc(sizeof(NODE));

p -> date = a;

q -> next = p;

q = p;

n--;

}

}

q -> next = NULL;

return(head);

}

void delete(NODE*head,int x)

{

NODE *p;

NODE *q;

q = head;

p = q -> next;

while((p != NULL) && (p -> date != x) )

{

q = p;

p = p -> next;

}

if(p == NULL)

{

printf("%d 不存在\n",x);

}

else

{

q -> next = p -> next;

free(p);

}

}

int main()

{

int x;

NODE *a;

NODE *b;

a = create();

printf("要删除的元素:\n");

scanf("%5d",&x);

delete(a,x);

b = a;

b = b->next;

printf("输出删除后的单链表:");

while(b != NULL)

{

printf("%5d",b->date);

b = b->next;

}

printf("\n");

return 0;

}