双向链表实现增删改查的操作

迷南。 2023-03-01 06:12 17阅读 0赞

更多资料请点击：[我的目录][Link 1]  
本篇仅用于记录自己所学知识及应用，代码仍可优化，仅供参考，如果发现有错误的地方，尽管留言于我，谢谢!

此篇是双向链表实现增删改查的操作，其中：  
"增"包括在链尾、链中增加节点  
"删"包括在链头、链中、链尾删除单个或多个节点  
"改"包括在链头、链中、链尾更改单个或多个节点数值  
"查"只是显示整个链表所有节点数值

#include <stdio.h>
    #include <stdlib.h>
    
    //设置节点
    struct node
    { 
    	int data;
    	struct node *next;
    	struct node *prev;
    };
    
    //初始化链表
    struct node *list_init()
    { 
    	struct node *head = malloc(sizeof(struct node));
    	head->next = NULL;
    	head->prev = NULL;
    	return head;
    }
    
    //创建新节点
    struct node *newnode(int newdata)
    { 
    	struct node *new = malloc(sizeof(struct node));
    	new->data = newdata;
    	new->next = NULL;
    	new->prev = NULL;
    }
    
    //加入新节点
    int addnode(int newdata,struct node *list)
    { 
    	struct node *p = list;
    	while(p->next != NULL)
    	{ 
    		p = p->next;
    	}
    	struct node *new = newnode(newdata);
    	p->next = new;
    	new->prev = p;
    	new->next = NULL;
    	printf("===成功加入节点%d===\n",newdata);
    }
    
    //插入新节点
    int insert(int olddata, int newdata, struct node *list)
    { 
    	int flag = 0;
    	struct node *p = list->next;
    	while(p->next != NULL)
    	{ 
    		if(p->data == olddata)
    		{ 
    			struct node *new = newnode(newdata);
    			new->next = p->next;
    			p->next = new;
    			new->next->prev = new;
    			new->prev = p;
    			flag = 1;
    			
    			//新旧节点数据相同时，跳过新节点，防止进入无限循环
    			if(olddata == newdata)
    			{ 
    				p = p->next;
    			}
    		}
    		p = p->next;
    	}
    	
    	if(p->next == NULL && p->data == olddata)
    	{ 
    		struct node *new = newnode(newdata);
    		p->next = new;
    		new->prev = p;
    		new->next = NULL;
    		flag = 1;
    
    			
    	}
    	if(flag == 0)
    	{ 
    		printf("原链表中没有%d这个数！\n",olddata);
    	}
    	else
    	{ 
    		printf("===在节点%d后插入节点%d===\n",olddata,newdata);
    	}
    }
    
    //删除节点
    int delnode(int deldata, struct node *list)
    { 
    	int flag = 0;
    	int m = 0;
    	struct node *p = list;
    	struct node *q ;
    	while(p->next != NULL)
    	{ 
    		if(p->data == deldata)
    		{ 
    			q = p->prev;
    			p->prev->next = p->next;
    			p->next->prev = p->prev;
    			p->next = NULL;
    			p->prev = NULL;
    			p = q;
    			flag = 1;
    			
    		}
    			p = p->next;
    	}
    	
    	if(p->next == NULL && p->data == deldata)
    	{ 
    		p->prev->next = NULL;
    		p->prev =NULL;
    		flag = 1;
    	}
    	if(flag == 0)
    	{ 
    		printf("原链表中没有%d这个数！\n",deldata);
    	}
    	else
    	{ 
    		printf("===成功删除节点%d===\n",deldata);
    	}
    }
    
    //修改节点数据
    int change(int olddata, int newdata, struct node *list)
    { 
    	int flag = 0;
    	struct node *p = list;
    	while(p != NULL)
    	{ 
    		if(p->data == olddata)
    		{ 
    			p->data = newdata;
    			flag = 1;
    		}
    		p = p->next;
    	}
    	if(flag == 0)
    	{ 
    		printf("原链表中没有%d这个数！\n",olddata);
    	}
    	else
    	{ 
    		printf("===节点%d修改为%d===\n",olddata,newdata);
    	}
    }
    
    //遍历输出所有节点的数据
    int show(struct node *list)
    { 
    	printf("链表各节点数据：\n");
    	struct node *p = list->next;
    	while(p != NULL)
    	{ 
    		printf("%d\t",p->data);
    		p = p->next;
    	}
    	printf("\n\n");
    }
    
    int main()
    { 
    	struct node *list =list_init();
    	struct node *list =list_init();
    	addnode(350,list);
    	addnode(100,list);
    	addnode(200,list);
    	addnode(200,list);
    	addnode(250,list);
    	addnode(800,list);
    	addnode(200,list);
    	addnode(100,list);
    	show(list);
    
    	insert(100,150,list);
    	show(list);
    	
    	delnode(200,list);
    	show(list);
    	
    	delnode(150,list);
    	show(list);
    	
    	delnode(350,list);
    	show(list);
    	
    	change(250,500,list);
    	show(list);
    	
    	insert(700,150,list);
    	show(list);
    	
    	delnode(700,list);
    	show(list);
    	
    	change(700,150,list);
    	show(list);
    	
    }

运行结果：  
![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80Mzc5MzE4MQ_size_16_color_FFFFFF_t_70]

[Link 1]: http://note.youdao.com/noteshare?id=1370b0e8f4a16b80e7dede7836df3c08
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80Mzc5MzE4MQ_size_16_color_FFFFFF_t_70]: /images/20230209/ac8b0ba993db45709e8d17c003462d29.png