#include <stdlib.h>
#include <string.h>
struct node{
int id;
struct node *next;
};
struct node *head=NULL;
struct node *tail=NULL;
struct node *first,*tmp,*last;
struct node *create(int num)
{
int i;
struct node *mid/*,*tail*/;
for(i=num;i>0;i--)
{
mid=(struct node*)malloc(sizeof(struct node));
if(mid==NULL)
{
perror("mid");
exit(-1);
}
printf("input id:");
scanf("%d",&(mid->id));
if(head==NULL)
{
head=mid;
tail=mid;
}else{
tail->next=mid;
tail=mid;
}
}
tail->next=NULL;
return head;
}
void delete(int id)
{
if(head==NULL)
{
printf("List is NULL \n");
exit(-1);
}else{
if(head->id==id)
{
first=head;
head=head->next;
free(first);
}else{
for(tmp=head;tmp->id!=id;){
last=tmp;
tmp=tmp->next;
}
if(tmp->id==id)
{
last->next=tmp->next;
free(tmp);
}
}
}
}
struct node *insert(int id)
{
struct node *p=(struct node*)malloc(sizeof(struct node));
if(p==NULL)
{
perror("p");
exit(-1);
}
p->id=id;
//tmp=head->next;
//head->next=p;
//p->next=tmp;
p->next=head;
return p;
}
int main(int argc,char** argv)
{
int num;
printf("input the struct long size:");
scanf("%d",&num);
struct node *p=create(num);
printf("\t create struct success\n");
while(p)
{
printf("%d ",p->id);
p=p->next;
}
printf("\n");
//delete(2);
p=insert(80);
//p=head;
while(p)
{
printf("%p: ",p->next);
printf("%d\n",p->id);
p=p->next;
}
//printf("\n");
return 0;
}