SDUT1138数据结构上机测试2-1:单链表操作A

#include<bits/stdc++.h>
using namespace std;
void bulidlist(int n);
void print();
void del(int n);
int key,rest;
struct node
{
int data;
struct node *next;
};
struct node *head,*tail,*p,*q;
int main()
{
int n;
cin>>n;
bulidlist(n);
cin>>key;
cout<<n<<endl;
print();
cout<<endl;
del(n);
cout<<rest<<endl;
print();
return 0;
}
void print()
{
p=head->next;
while(p)
{
cout<<p->data;
if(p->next)
cout<<" ";
p=p->next;
}
}
void bulidlist(int n)
{
head=(struct node *)malloc(sizeof(struct node));
head->next=NULL;
tail=head;
while(n--)
{
p=(struct node *)malloc(sizeof(struct node));
cin>>p->data;
p->next=NULL;
tail->next=p;
tail=p;
}
}
void del(int n)
{
rest=n;
p=head;
while(p->next)
{
if(p->next->data==key)
{
rest--;
q=p->next;
p->next=q->next;
free(q);
}
else
p=p->next;
}
}