#include <malloc.h>
{
int date;
struct node *next;
{
int a;
int n;
NODE *p;
NODE *q;
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);
}
{
NODE *p;
NODE *q;
q = head;
p = q -> next;
{
q = p;
p = p -> next;
}
if(p == NULL)
{
printf("%d 不存在\n",x);
}
else
{
q -> next = p -> next;
free(p);
}
}
{
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;
}