链表结点的统计,插入,删除

#include"stdio.h"
#include"stdlib.h"
#include"malloc.h"
void print(struct linklist *head);
void del(struct linklist *head,int i);
void insert(struct linklist *head,int i,int m,int n);
struct linklist
{
int x,y;
struct linklist *next;
};

int number(struct linklist *head)
{
int n=0;
struct linklist *p;
p=head;
while(p!=NULL)
{n++;
p=p->next;
}
return (n);
}
main()
{
struct linklist head,p;
head=NULL;
p=(struct linklist)malloc(sizeof(struct linklist));
scanf("%d,%d",&p->x,&p->y);
while(p->x>=0&&p->y>=0)
{
p->next=head;
head=p;
p=(struct linklist)malloc(sizeof(struct linklist));
scanf("%d,%d",&p->x,&p->y);
}
printf(“节点数=%2d\n”,number(head));
print(head);
insert(head,3,8,8);
print(head);
printf(“节点数=%2d\n”,number(head));
del(head,2);
print(head);
printf(“节点数=%2d\n”,number(head));
}

void print(struct linklist *head)
{
struct linklist *p;
p=head;
while(p!=NULL)
{printf("(%d,%d)",p->x,p->y);
p=p->next;
}
printf("\n");
}

void insert(struct linklist *head,int i,int m,int n)
{
int j;
struct linklist *p,q;
p=head;
j=1;
while((p!=NULL)&&(j<i))
{
p=p->next;
j++;
}
q=(struct linklist)malloc(sizeof(struct linklist));
q->x=m,q->y=n;
q->next=p->next;
p->next=q;
}

void del(struct linklist *head,int i)
{
int j;
struct linklist *p,*q;
p=head;
j=1;
while((p!=NULL)&&(j<i))
{
q=p;
p=p->next;
j++;
}
if(p==NULL) printf(“找不到结点!\n”);
else
{q->next=p->next;
free§;
}
}