描述

主題：鏈表
功能：分別實鏈表的插入、刪除、查找操作
提示：如果需要進入下一步操作，輸入3個ctrl z即可

代碼

//主題：鏈表 //功能：分別實鏈表的插入、刪除、查找操作 //提示：如果需要進入下一步操作，輸入3個ctrl z即可#define _CRT_SECURE_NO_WARNINGS #include<stdio.h> #include<stdlib.h> typedef struct student {int num;float score;struct student *pnext; }stu, *pstu;//打印 void list_print(pstu phead, pstu ptail) {pstu pcur = phead;while (pcur != NULL){printf("%d %2.2f\n", pcur->num, pcur->score);pcur = pcur->pnext;}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;//不用擔心尾節點不是NULL，因為calloc的pnew中的pnext成員本身就是null}else{pnew->pnext = *pphead;//新節點的pnext成員指向原有鏈表頭*pphead = pnew;//新節點成為新的鏈表頭} }//增：尾插法 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;//不用擔心尾節點不是NULL，因為calloc的pnew中的pnext成員本身就是null}else{(*pptail)->pnext = pnew;//原有鏈表尾的pnext成員指向新節點*pptail = pnew;//新節點成為新的鏈表尾} }//增：有序插入 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;//不用擔心尾節點不是NULL，因為calloc的pnew中的pnext成員本身就是null}else{//從小到大if (i <= pcur->num)//如果小于第一個節點，頭插{pnew->pnext = *pphead;//新節點的pnext成員指向原有鏈表頭*pphead = pnew;//新節點成為新的鏈表頭return;}else//向后遍歷{while (NULL != pcur)//只要不是最后{if (i <= pcur->num){pbefore->pnext = pnew;//小弟的pnext成員指向新節點pnew->pnext = pcur;//新節點的pnext成員指向大哥break;}pbefore = pcur;//小弟記住大哥的腳印pcur = pcur->pnext;//大哥先走一步 }if (NULL == pcur)//如果到最后，尾插{(*pptail)->pnext = pnew;//原有鏈表尾的pnext成員指向新節點*pptail = pnew;//新節點成為新的鏈表尾}}} }//刪除 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)//如果等于第一個節點（此時可能僅剩一個節點）{*pphead = (*pphead)->pnext;//頭指針指向下一個節點if (NULL == *pphead){*pptail = NULL;free(pcur);}}else//如果不等于第一個節點{while (NULL != pcur)//只要不是最后{if (i == pcur->num)//如果等于當前節點{pcur = pcur->pnext;//大哥前進一步pbefore->pnext = pcur;//小弟的pnext成員指向大哥return;}else{pbefore = pcur;//小弟記住大哥的腳印pcur = pcur->pnext;//大哥先走一步 }}if (NULL == pcur)//如果到最后{printf("不存在此數字\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)//如果等于當前節點,修改{pcur->score = score;return;}else{pbefore = pcur;//小弟記住大哥的腳印pcur = pcur->pnext;//大哥先走一步 }}if (NULL == pcur)//如果到最后{printf("不存在此數字\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)//如果等于當前節點,輸出{printf("查詢成功：\n%d %2.2f\n", i, pcur->score);return;}else{pbefore = pcur;//小弟記住大哥的腳印pcur = pcur->pnext;//大哥先走一步 }}if (NULL == pcur)//如果到最后{printf("不存在此數字\n");}} }int main() {int i;float score;pstu phead = NULL;pstu ptail = NULL;//增printf("請輸入你要插入的數字:");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("請輸入你要刪除的數字：");while (scanf("%d", &i) != EOF){list_delete(&phead, &ptail, i);printf("輸出：\n");list_print(phead, ptail);}//改 printf("請輸入你要修改的序號和數字：");while (scanf("%d %f", &i, &score) != EOF){list_modify(&phead, &ptail, i, score);printf("輸出：\n");list_print(phead, ptail);}//查printf("請輸入你要查找的序號：");while (scanf("%d", &i) != EOF){list_find(&phead, &ptail, i);}system("pause");

總結

以上是生活随笔為你收集整理的C语言 线性表的链式存储结构（链表实现）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。