山东理工大学acm平台题目答案_p3kbcnu.docVIP

1464 #includestdio.h #includestdlib.h struct node { int date; struct node *next; }; struct node *creat(struct node *head,int m) { int i; struct node *p,*tail; head-next=NULL; tail=head; for(i=1;i=m;i++) { p=(struct node*)malloc(sizeof(struct node)); scanf(%d,p-date); p-next=NULL; tail-next=p; tail=p; } return head; } struct node *del(struct node *head,int z,int r) { struct node *q,*p; int i=0; p=head; while(p-next!=NULL) { if((p-next-date=z)(p-next-date=r)) { i=1; break; } else p=p-next; } if(i==1) { q=p-next; p-next=q-next; free(q); return p;