带头节点单链表的增删改查

#include<stdio.h>
#include<stdlib.h>
typedef int ElemType;
typedef struct Node{
	ElemType data;
	struct Node *next; 
}Node,*LinkList;
//返回值初始化
Node * init_list_return(Node *l){
	l = (Node *)malloc(sizeof(Node));
	l->data = 0;//带头结点存储链表长度 
	l->next = NULL;
	return l;
}
//无返回值初始化 
void init_list_no_return(LinkList *l){
	(*l) = (Node *)malloc(sizeof(Node));
	(*l)->data = 0;//带头结点存储链表长度 
	(*l)->next = NULL;
}
//尾插法创建链表 
void tail_create_list(Node *l){
	Node *p;
	int *num;
	num = &l->data;
	int x=0;
	while(1)
	{
		printf("请输入你想初始化的数字，以回车分割，以-1结束\n");
		scanf("%d",&x);
		if(x == -1)
		{
			break;
		}else{
			p = (Node *)malloc(sizeof(Node));
			p->data = x;
			p->next = NULL;
			l->next = p;
			l = p;
			(*num)++;
		}
	}
}
//头插法创建链表 
void head_create_list(Node *l){
	Node *p;
	int x=0;
	int *num;
	num = &l->data;
	while(1)
	{
		printf("请输入你想初始化的数字，以回车分割，以-1结束\n");
		scanf("%d",&x);
		if(x == -1)
		{
			break;
		}else{
			p = (Node *)malloc(sizeof(Node));
			p->data = x;
			p->next = l->next;
			l->next = p;
			(*num)++; 
		}
	}
}
//按位置插入 
Node * insert_site(Node *l){
	int site,n;
	Node *p,*q;
	int *num;
	num = &l->data;
	p = l;
	q = (Node *)malloc(sizeof(Node));
	printf("请输入你要插入的位置(1-%d之间)和数字以空格分割\n",(l->data)+1);
	scanf("%d %d",&site,&n);
	if(site<=0||site>(l->data)+1){
		printf("ERROR\n");
	}else{
		q->data = n;
		while(site-1>0){
			p = p->next;
			site--;
		}
		q->next = p->next;
		p->next = q;
		(*num)++;
	}
	return l;
}
//按数值插入 
Node * insert_num(Node *l){
	int n,n1;
	Node *p,*q;
	int *num;
	num = &l->data;
	p = l->next;
	q = (Node *)malloc(sizeof(Node));
	printf("输入按值插入的值以及你想插入的值\n");
	scanf("%d %d",&n,&n1);
	while(p->data!=n){
		p = p->next;
		if(p==NULL){
			printf("这个表中没有你要插入的元素\n");
			return l; 
		}
	}
	q->data = n1;
	q->next = p->next;
	p->next = q;
	(*num)++;
	return l;
}
//按照位置删除 
Node * delete_site(Node *l){
	int site;
	Node *p;
	int *num;
	num = &l->data;
	p = l;
	printf("请输入你要删除数字的位置\n");
	scanf("%d",&site);
	if((*num)==0){
		printf("空表无法删除元素\n"); 
	}
	else if(site<=0||site>(l->data)){
		printf("删除的数值越界\n");
	}else{
		while(site-1>0){
			p = p->next;
			site--;
		}
		p->next = p->next->next;
		(*num)--;
	}
	return l;
}
//按照数值删除 
Node * delete_num(Node *l){
	int n;
	Node *p;
	int *num;
	num = &l->data;
	p = l;
	printf("输入按值删除的值\n");
	scanf("%d",&n);
	while(p->next->data!=n){
		p = p->next;
		if(p==NULL){
			printf("这个表中没有你要删除的元素\n");
			return l;
		}
	}
	p->next = p->next->next;
	(*num)--;
	return l;
}
//按照位置修改 
Node * alter_site(Node *l){
	int site,n;
	Node *p;
	p = l->next;
	printf("请输入你要修改数字的位置和数字\n");
	scanf("%d %d",&site,&n);
	if((l->data)==0){
		printf("空表无法修改元素\n"); 
	}
	else if(site<=0||site>(l->data)){
		printf("修改的数值越界\n");
	}else{
		while(site-1>0){
			p = p->next;
			site--;
		}
		p->data = n;
	}
	return l;
}
//按照数值修改 
Node * alter_num(Node *l){
	int n,n1;
	Node *p;
	p = l->next;
	printf("输入按值修改的值以及你要输入的值\n");
	scanf("%d %d",&n,&n1);
	while(p->data!=n){
		p = p->next;
		if(p==NULL){
			printf("这个表中没有你要修改的元素\n");
			return l;
		}
	}
	p->data = n1;
	return l;
}
//按照为重查询 
void search_site(Node *l){
	int site;
	Node *p;
	p = l->next;
	printf("请输入你要查找数字的位置\n");
	scanf("%d",&site);
	if((l->data)==0){
		printf("该表为空\n"); 
	}
	else if(site<=0||site>(l->data)){
		printf("查找的数值越界\n");
	}else{
		while(site-1>0){
			p = p->next;
			site--;
		}
		printf("%d\n",p->data);
	}
}
//按照数值查询 
void search_num(Node *l){
	int n;
	Node *p;
	p = l->next;
	printf("输入你要查找的值\n"); 
	scanf("%d",&n);
	while(p!=NULL){
		if(p->data == n){
			printf("%d\n",p->data);
		}
		else if(p->next==NULL){
			printf("这个表中没有你要查找的元素\n");
		}
		p = p->next;
	}
}
//打印链表 
void print_list(Node *l){
	Node *n;
	n = l->next;
	if(l->next == NULL){
		printf("该表为空\n"); 
	}else{
		while(n){
			printf("%d ",n->data);
			n = n->next;
		}
	}
	printf("\n");
}
//显示菜单 
void menu(){
	printf("请输入数字，进行选择操作\n");
	printf("1.代表初始化单链表\n");
	printf("2.代表头插法创建单链表\n");
	printf("3.代表尾插法创建单链表\n");
	printf("4.代表按位置插入元素\n");
	printf("5.代表按值插入元素\n");
	printf("6.代表按位置删除元素\n");
	printf("7.代表按值删除元素\n");
	printf("8.代表按位置修改元素\n");
	printf("9.代表按值修改元素\n");
	printf("10.代表按位置查询元素\n");
	printf("11.代表按值查询元素\n");
	printf("12.代表打印单链表\n");
	printf("13.退出系统\n");
}
//主函数 
int main(){
	Node *l;
	int select,flag=1;
	while(flag){
		menu();
		scanf("%d",&select);
		switch(select){
			case 1: 
				l = init_list_return(l);
				break;
			case 2: 
				head_create_list(l);
				break;
			case 3:
				tail_create_list(l);
				break;
			case 4:
				l = insert_site(l);
				break;
			case 5:
				l = insert_num(l);
				break;
			case 6:
				l = delete_site(l);
				break;
			case 7:
				l = delete_num(l);
				break;
			case 8:
				l = alter_site(l);
				break;
			case 9:	
				l = alter_num(l);
				break;
			case 10:
				search_site(l);
				break;
			case 11:
				search_num(l);
				break;
			case 12:
				print_list(l);
				break;
			case 13:
				flag = 0;
				break;
			default:
				printf("请规范输入\n");
				break;
		}
	}
	return 0;
}