主題：雙向鏈表
功能：分別實(shí)鏈表的插入、刪除、查找、打印（正序、逆序）操作
提示：如果需要進(jìn)入下一步操作，輸入3個(gè)ctrl z即可

//主題：雙向鏈表 //功能：分別實(shí)鏈表的插入、刪除、查找操作 //提示：如果需要進(jìn)入下一步操作，輸入3個(gè)ctrl z即可#define _CRT_SECURE_NO_WARNINGS #include<stdio.h> #include<stdlib.h> typedef struct student {int num;float score;struct student *pnext;struct student *ppre; }stu, *pstu;//打印 void list_print(pstu phead, pstu ptail) {pstu pcur = phead;printf("順序打印：\n");while (pcur != NULL){printf("%d %2.2f\n", pcur->num, pcur->score);pcur = pcur->pnext;}printf("\n");printf("逆序打印：\n");pcur = ptail;while (pcur != NULL){printf("%d %2.2f\n", pcur->num, pcur->score);pcur = pcur->ppre;}printf("\n"); }//增：頭插法(插在左邊) void list_insert_head(pstu *pphead, pstu *pptail, int i) {pstu pnew;pnew = (pstu)calloc(1, sizeof(stu));pnew->num = i;if (NULL == *pptail)//如果鏈表為空{*pphead = pnew;*pptail = pnew;//不用擔(dān)心尾節(jié)點(diǎn)不是NULL，因?yàn)閏alloc的pnew中的pnext成員本身就是null}else//如果鏈表非空{pnew->pnext = *pphead;//新節(jié)點(diǎn)的pnext成員指向原有鏈表頭(*pphead)->ppre = pnew;//新節(jié)點(diǎn)的ppre指向原有鏈表頭*pphead = pnew;//新節(jié)點(diǎn)成為新的鏈表頭} }//增：尾插法 void list_insert_tail(pstu *pphead, pstu *pptail, int i) {pstu pnew;pnew = (pstu)calloc(1, sizeof(stu));pnew->num = i;if (NULL == *pptail)//如果鏈表為空{*pphead = pnew;*pptail = pnew;//不用擔(dān)心尾節(jié)點(diǎn)不是NULL，因?yàn)閏alloc的pnew中的pnext成員本身就是null}else{(*pptail)->pnext = pnew;//原有鏈表尾的pnext成員指向新節(jié)點(diǎn)pnew->ppre = *pptail;//新節(jié)點(diǎn)的ppre指向原有鏈表尾*pptail = pnew;//新節(jié)點(diǎn)成為新的鏈表尾} }//增：有序插入 void list_insert_sort(pstu *pphead, pstu *pptail, int i) {pstu pnew;pnew = (pstu)calloc(1, sizeof(stu));pnew->num = i;pstu pcur = *pphead;pstu pbefore = *pphead;if (NULL == *pptail)//如果鏈表為空{*pphead = pnew;*pptail = pnew;//不用擔(dān)心尾節(jié)點(diǎn)不是NULL，因?yàn)閏alloc的pnew中的pnext成員本身就是null}else{//從小到大if (i <= pcur->num)//如果小于第一個(gè)節(jié)點(diǎn)，頭插{pnew->pnext = *pphead;//新節(jié)點(diǎn)的pnext成員指向原有鏈表頭(*pphead)->ppre = pnew;//新節(jié)點(diǎn)的ppre指向原有鏈表頭*pphead = pnew;//新節(jié)點(diǎn)成為新的鏈表頭return;}else//向后遍歷{while (NULL != pcur)//只要不是最后{if (i <= pcur->num)//找到插入的位置{pbefore->pnext = pnew;//小弟的pnext成員指向新節(jié)點(diǎn)pnew->ppre = pbefore;//新節(jié)點(diǎn)的ppre成員指向pbeforepnew->pnext = pcur;//新節(jié)點(diǎn)的pnext成員指向大哥pcur->ppre = pnew;//大哥的ppre成員指向新節(jié)點(diǎn)break;}pbefore = pcur;//小弟記住大哥的腳印pcur = pcur->pnext;//大哥先走一步 }if (NULL == pcur)//如果到最后，尾插{(*pptail)->pnext = pnew;//原有鏈表尾的pnext成員指向新節(jié)點(diǎn)pnew->ppre = *pptail;//新節(jié)點(diǎn)的ppre成員指向原有鏈表尾*pptail = pnew;//新節(jié)點(diǎn)成為新的鏈表尾}}} }//刪除 void list_delete(pstu *pphead, pstu *pptail, int i) {pstu pcur = *pphead;pstu pbefore = *pphead;if (NULL == *pptail)//如果鏈表為空{printf("鏈表為空\n");}else if (i == (*pphead)->num)//如果要?jiǎng)h除第一個(gè)節(jié)點(diǎn)（此時(shí)可能僅剩一個(gè)節(jié)點(diǎn)）{(*pphead)->pnext->ppre = (*pphead)->ppre;//下一個(gè)節(jié)點(diǎn)的ppre指向原有頭節(jié)點(diǎn)的ppre（=NULL）*pphead = (*pphead)->pnext;//頭指針指向下一個(gè)節(jié)點(diǎn)free(pcur);//釋放原有頭節(jié)點(diǎn)的內(nèi)存if (NULL == *pphead)//如果刪除后鏈表為空{*pptail = NULL;}}else//如果不等于第一個(gè)節(jié)點(diǎn){while (NULL != pcur)//如果pcur沒有走出最后一個(gè)節(jié)點(diǎn){if (i == pcur->num)//如果等于當(dāng)前節(jié)點(diǎn){pcur = pcur->pnext;//大哥前進(jìn)一步pbefore->pnext = pcur;//小弟的pnext成員指向大哥pcur->ppre = pbefore;//大哥的ppre成員指向小弟return;}else{pbefore = pcur;//小弟記住大哥的腳印pcur = pcur->pnext;//大哥先走一步 }}if (NULL == pcur)//如果到最后{printf("不存在此數(shù)字\n");}} }//修改 void list_modify(pstu *pphead, pstu *pptail, int i, float score) {pstu pcur = *pphead;pstu pbefore = *pphead;if (NULL == *pptail)//如果鏈表為空{printf("鏈表為空\n");}else{while (NULL != pcur)//只要不是最后{if (i == pcur->num)//如果等于當(dāng)前節(jié)點(diǎn),修改{pcur->score = score;return;}else{pbefore = pcur;//小弟記住大哥的腳印pcur = pcur->pnext;//大哥先走一步 }}if (NULL == pcur)//如果到最后{printf("不存在此數(shù)字\n");}} }//查找 void list_find(pstu *pphead, pstu *pptail, int i) {pstu pcur = *pphead;pstu pbefore = *pphead;if (NULL == *pptail)//如果鏈表為空{printf("鏈表為空\n");}else{while (NULL != pcur)//只要不是最后{if (i == pcur->num)//如果等于當(dāng)前節(jié)點(diǎn),輸出{printf("查詢成功：\n%d %2.2f\n", i, pcur->score);return;}else{pbefore = pcur;//小弟記住大哥的腳印pcur = pcur->pnext;//大哥先走一步 }}if (NULL == pcur)//如果到最后{printf("不存在此數(shù)字\n");}} }int main() {int i;float score;pstu phead = NULL;pstu ptail = NULL;//增printf("請(qǐng)輸入你要插入的數(shù)字:");while (scanf("%d", &i) != EOF){list_insert_head(&phead, &ptail, i);//頭插法//list_insert_tail(&phead, &ptail, i);//尾插法//list_insert_sort(&phead, &ptail, i);//有序插入}list_print(phead, ptail);//刪printf("請(qǐng)輸入你要?jiǎng)h除的數(shù)字：");while (scanf("%d", &i) != EOF){list_delete(&phead, &ptail, i);printf("輸出：\n");list_print(phead, ptail);}//改 printf("請(qǐng)輸入你要修改的序號(hào)和數(shù)字：");while (scanf("%d %f", &i, &score) != EOF){list_modify(&phead, &ptail, i, score);printf("輸出：\n");list_print(phead, ptail);}//查printf("請(qǐng)輸入你要查找的序號(hào)：");while (scanf("%d", &i) != EOF){list_find(&phead, &ptail, i);}system("pause"); }

總結(jié)

以上是生活随笔為你收集整理的C语言 双向链表的增删改查的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。