数据结构链表基本的增删改查源码

#include<stdio.h>
#include<malloc.h>
typedef struct node{
	int data;
	struct node *next;
}Node;

//初始化一个节点 
Node* Init(){
	Node *list;
	list = (Node*)malloc(sizeof(Node));
	list->next = NULL;
	return list;
}
//求链表长度 
int len(Node *list){
	int length=0;
	while(list->next != NULL){
		length++;
		list = list->next;
	}
	return length;
}
//链表尾部添加节点 
void add(Node *list,int data,int flag){
	int length;
	length = len(list);
	for(int i= 0;i<flag;i++){
		list = list->next;
	}
	Node *p;
	p = Init();
	p->data = data;
	p->next = list->next;
	list->next = p;
}
//删除指定位置节点 
void del(Node* list,int flag){
	for(int i = 1;i<flag;i++){
		list = list->next;
	}
	Node *p;
	p = Init();
	p = list->next;
	list->next = p->next;
	free(p); 
}
//查找数据，并返回节点位置
int findnode(Node* list,int data){
	int a = 0;
	int length = len(list);
	for(int i=0;i<length;i++){
		a++;
		list = list->next;
		if(list->data == data){
			return a;
		}
	}
	return 0;
} 
//更改指定节点数据 
void changenode(Node* list,int flag,int data) {
	for(int i = 0;i<flag;i++){
		list = list->next;
	}
	list->data = data;
	
}

void insertnode(Node* list,int flag,int data){
	for(int i=0;i<flag;i++){
		list = list->next;
	}
	Node *p;
	p = (Node*)malloc(sizeof(Node));
	p->data = data;
	p->next = list->next;
	list->next = p;
	
} 
int main(){
	int n;
	Node *list;
	int length,data;
	list = Init();
	scanf("%d",&n);
	for(int i = 0;i < n;i++){
		scanf("%d",&data);
		add(list,data,i);//添加元素 
	}
	int a = findnode(list,2);//查找元素2 
	del(list,a);//删除所查找到的位置 
	changenode(list,3,5);//更改第三个节点的数据为5 
	printf("%d\n",a);
	length = len(list);
	for(int i = 0;i<length;i++){
		list = list->next;
		printf("%5d",list->data);
	}
	return 0;
}