链表dsaddddddddddddddddddddd

#include<stdio.h>

#include<malloc.h>

struct no {

int ct;

struct no *next;

};

struct no * create(int n) {

struct no *head,*p,*q;

p=head=(struct no*)malloc(sizeof(struct no));

int i;

for(i=1; i<=n; i++) {

q=(struct no*)malloc(sizeof(struct no));

scanf("%d",&q->ct);

p->next=q;

p=p->next;

}

p->next=NULL;

return head;

}

void prt(struct no *head) {

struct no *p;

p=head->next;

while(p!=NULL) {

printf("%d\n",p->ct);

p=p->next;

}

}

struct no *insert(struct no *head,int m) {

struct no *qz,*p,*mp;

mp=(struct no*)malloc(sizeof(struct no));

mp->ct=m;

qz=head;

p=head->next;

while(p!=NULL&&p->ct<m) {

qz=p;

p=p->next;

}

if(p==NULL) {

qz->next=mp;

mp->next=NULL;

} else {

qz->next=mp;

mp->next=p;

}

}

void dol(struct no *head,int m) {

struct no *q,*p;

q=head;

p=head->next;

while(p!=NULL&&p->ct!=m) {

q=p;

p=p->next;

}

if(p==NULL)

printf("no");

else {

q->next=p->next;

free(p);

}

}

main() {

struct no *head;

int n,m;

scanf("%d",&n);

head=create(n);

prt(head);

scanf("%d",&m);

dol(head,m);

prt(head);

}