王道数据结构p40——7

王道数据结构p40——7

代码

#include<stdio.h>
#include<stdlib.h>
typedef struct lnode{
	int data;
	lnode *next;
}lnode,*linklist; 

void del(linklist &l,int a,int b);

int main(){
	linklist l;
	l = (lnode*)malloc(sizeof(lnode));
	l->next = NULL;
	
	int a[10] = {2,6,1,3,4,7,5};
	
	lnode *s,*p;
	s=l;
	int n=7;
	for(int i=0;i<n;i++){
		p = (lnode*)malloc(sizeof(lnode));
		p->data = a[i];
		s->next = p;
		s=p;
	}
	s->next = NULL;
	
	/*s=l->next;
	while(s!=NULL){
		printf("%d\n",s->data);
		s=s->next;
	}*/
	del(l,3,5);
			
	s=l->next;
	while(s!=NULL){
		printf("%d\n",s->data);
		s=s->next;
	}

	return 0;
} 

void del(linklist &l,int a,int b){
	lnode *p,*pre;
	p=l->next;
	pre = l;
	while(p!=NULL){
		if(p->data >= a  && p->data <= b){
			pre->next = p->next;
			free(p);
			p = pre->next;
		}
		else{
			p = p->next;
			pre = pre->next;
		}
	}	
}