#include#include#include#define ERROR 0#define OK 1#define OVERFLOW 2typedef int status;typedef int elemtype;typedef struct Lnode{ elemtype data; struct Lnode next;}Lnode,;void createlist_L(linklist l,int n){ Lnode linklistp,*q; int i; l=(linklist)malloc(sizeof(Lnode)); l->next=NULL; p=l; for(i=0;i<n;i++){ q=(Lnode)malloc(sizeof(Lnode)); if(!p) exit(OVERFLOW); scanf("%d",&q->data); q->next=NULL; p->next=q; p=q; } }status listdelete_l(linklist l,int mink,int maxk){ linklist p,q,prve=NULL; if(mink>maxk) return ERROR; p=l; prve=p; p=p->next; while(p&&p->datadata<=mink){ prve=p; p=p->next; } else { prve->next=p->next; q=p; p=p->next; free(q); } } return OK; } main(){ int n,mink,maxk; linklist l; Lnode *p=l->next; printf("请输入节点个数n:"); scanf("%d",&n); createlist_L(l,n); printf("请输入mink和maxk:"); scanf("%d%d",&mink,&maxk); listdelete_l(l,mink,maxk); while(p!=NULL) { printf("%d",p->data); p=p->next; } system("pause"); }
代码看不清,给你个现成的
http://blog.csdn.net/iwm_next/article/details/7450734