本篇文章為大家展示了怎么在C語(yǔ)言中實(shí)現(xiàn)一個(gè)循環(huán)單鏈表功能,內(nèi)容簡(jiǎn)明扼要并且容易理解,絕對(duì)能使你眼前一亮,通過(guò)這篇文章的詳細(xì)介紹希望你能有所收獲。
創(chuàng)新互聯(lián)服務(wù)緊隨時(shí)代發(fā)展步伐,進(jìn)行技術(shù)革新和技術(shù)進(jìn)步,經(jīng)過(guò)10余年的發(fā)展和積累,已經(jīng)匯集了一批資深網(wǎng)站策劃師、設(shè)計(jì)師、專業(yè)的網(wǎng)站實(shí)施團(tuán)隊(duì)以及高素質(zhì)售后服務(wù)人員,并且完全形成了一套成熟的業(yè)務(wù)流程,能夠完全依照客戶要求對(duì)網(wǎng)站進(jìn)行網(wǎng)站建設(shè)、網(wǎng)站設(shè)計(jì)、建設(shè)、維護(hù)、更新和改版,實(shí)現(xiàn)客戶網(wǎng)站對(duì)外宣傳展示的首要目的,并為客戶企業(yè)品牌互聯(lián)網(wǎng)化提供全面的解決方案。SClist.h
#ifndef __SCLIST_H__ #define __SCLIST_H__ #include<cstdio> #include<malloc.h> #include<assert.h> typedef int ElemType; typedef struct Node { ElemType data; struct Node *next; }Node,*PNode; typedef struct List { PNode first; PNode last; size_t size; }List; void InitSClist(List *list);//初始化循環(huán)單鏈表 void push_back(List *list, ElemType x);//在循環(huán)單鏈表的末尾插入元素 void push_front(List *list, ElemType x);//在循環(huán)單鏈表的頭部插入元素 void show_list(List *list);//打印循環(huán)單鏈表 void pop_back(List *list);//刪除循環(huán)單鏈表的最后一個(gè)元素 void pop_front(List *list);//刪除循環(huán)單鏈表的第一個(gè)元素 void insert_val(List *list, ElemType val);//將數(shù)據(jù)元素插入到循環(huán)單鏈表中(要求此時(shí)循環(huán)單鏈表中的數(shù)據(jù)元素順序排列) Node* find(List *list, ElemType x);//查找循環(huán)單鏈表中數(shù)據(jù)值為x的結(jié)點(diǎn) int length(List *list);//求循環(huán)單鏈表的長(zhǎng)度 void delete_val(List *list, ElemType x);//按值刪除循環(huán)單鏈表中的某個(gè)數(shù)據(jù)元素 void sort(List *list);//對(duì)循環(huán)單鏈表進(jìn)行排序 void reverse(List *list);//逆置循環(huán)單鏈表 void clear(List *list);//清除循環(huán)單鏈表 void destroy(List *list);//摧毀循環(huán)單鏈表 //優(yōu)化 Node* _buynode(ElemType x);//創(chuàng)建結(jié)點(diǎn) #endif
SClist.cpp
#include"SClist.h" Node* _buynode(ElemType x) { Node *s = (Node*)malloc(sizeof(Node)); assert(s != NULL); s->data = x; s->next = NULL; return s; } void InitSClist(List *list) { Node *s = (Node*)malloc(sizeof(Node)); assert(s != NULL); list->first = list->last = s; list->last->next = list->first;//讓鏈表最后一個(gè)結(jié)點(diǎn)的指針域指向頭結(jié)點(diǎn),從而時(shí)鏈表循環(huán) list->size = 0; } void push_back(List *list, ElemType x) { Node *s = _buynode(x); list->last->next = s; list->last = s; list->last->next = list->first; list->size++; } void push_front(List *list, ElemType x) { Node *s = _buynode(x); s->next = list->first->next; list->first->next = s; if (list->last == list->first) list->last = s; list->size++; } void show_list(List *list) { Node *p = list->first->next; while (p != list->first) { printf("%d->", p->data); p = p->next; } printf("Nul.\n"); } void pop_back(List *list) { if (list->size == 0) return; Node *p = list->first; while (p->next != list->last) p = p->next; free(list->last); list->last = p; list->last->next = list->first; list->size--; } void pop_front(List *list) { if (list->size == 0) return; Node *p = list->first->next; list->first->next = p->next; if (list->size == 1) list->last = list->first; free(p); list->size--; } void insert_val(List *list, ElemType x) { Node *p = list->first; while (p->next != list->last && p->next->data < x) p = p->next; if (p->next == list->last && p->next->data < x) push_back(list, x); else { Node *s = _buynode(x); s->next = p->next; p->next = s; list->size++; } } Node* find(List *list, ElemType key) { if (list->size == 0) return NULL; Node *p = list->first->next; while(p != list->first && p->data != key) p = p->next; if (p == list->first) return NULL; return p; } int length(List *list) { return list->size; } void delete_val(List *list, ElemType x) { if (list->size == 0) return; Node *p = find(list, x); if (p == NULL) { printf("沒(méi)有要?jiǎng)h除的數(shù)據(jù)!\n"); return; } if (p == list->last) pop_back(list); else { Node *q = p->next; p->data = q->data; p->next = q->next; free(q); list->size--; } } void sort(List *list) { if (list->size == 0 || list->size == 1) return; Node *s = list->first->next; Node *q = s->next; list->last->next = NULL; list->last = s; list->last->next = list->first; while (q != NULL) { s = q; q = q->next; Node *p = list->first; while (p->next != list->last && p->next->data < s->data) p = p->next; if (p->next == list->last &&p->next->data < s->data) { list->last->next = s; list->last = s; list->last->next = list->first; } else { s->next = p->next; p->next = s; } } } void reverse(List *list) { if (list->size == 0 || list->size == 1) return; Node *p = list->first->next; Node *q = p->next; list->last->next = NULL; list->last = p; list->last->next = list->first; while (q != NULL) { p = q; q = q->next; p->next = list->first->next; list->first->next = p; } } void clear(List *list) { Node *p = list->first->next; while (p != list->first) { list->first->next = p->next; free(p); p = list->first->next; } list->last = list->first; list->last->next = list->first; list->size = 0; } void destroy(List *list) { clear(list); free(list->first); list->first = list->last = NULL; }
main.cpp
#include"SClist.h" void main() { List mylist; InitSClist(&mylist); ElemType item; Node *p = NULL; int select = 1; while (select) { printf("*******************************************\n"); printf("*[1] push_back [2] push_front *\n"); printf("*[3] show_list [4] pop_back *\n"); printf("*[5] pop_front [6] insert_val *\n"); printf("*[7] find [8] length *\n"); printf("*[9] delete_val [10] sort *\n"); printf("*[11] reverse [12] clear *\n"); printf("*[13*] destroy [0] quit_system *\n"); printf("*******************************************\n"); printf("請(qǐng)選擇:>>"); scanf("%d", &select); if (select == 0) break; switch (select) { case 1: printf("請(qǐng)輸入要插入的數(shù)據(jù)(-1結(jié)束):>"); while (scanf("%d", &item), item != -1) { push_back(&mylist, item); } break; case 2: printf("請(qǐng)輸入要插入的數(shù)據(jù)(-1結(jié)束):>"); while (scanf("%d", &item), item != -1) { push_front(&mylist, item); } break; case 3: show_list(&mylist); break; case 4: pop_back(&mylist); break; case 5: pop_front(&mylist); break; case 6: printf("請(qǐng)輸入要插入的數(shù)據(jù):>"); scanf("%d", &item); insert_val(&mylist, item); break; case 7: printf("請(qǐng)輸入要查找的數(shù)據(jù):>"); scanf("%d", &item); p = find(&mylist, item); if (p == NULL) printf("要查找的數(shù)據(jù)在單鏈表中不存在!\n"); break; case 8: printf("單鏈表的長(zhǎng)度為%d\n", length(&mylist)); break; case 9: printf("請(qǐng)輸入要?jiǎng)h除的值:>"); scanf("%d", &item); delete_val(&mylist, item); break; case 10: sort(&mylist); break; case 11: reverse(&mylist); break; case 12: clear(&mylist); break; //case 13: //destroy(&mylist); //break; default: printf("選擇錯(cuò)誤,請(qǐng)重新選擇!\n"); break; } } destroy(&mylist); }
上述內(nèi)容就是怎么在C語(yǔ)言中實(shí)現(xiàn)一個(gè)循環(huán)單鏈表功能,你們學(xué)到知識(shí)或技能了嗎?如果還想學(xué)到更多技能或者豐富自己的知識(shí)儲(chǔ)備,歡迎關(guān)注創(chuàng)新互聯(lián)網(wǎng)站建設(shè)公司行業(yè)資訊頻道。
另外有需要云服務(wù)器可以了解下創(chuàng)新互聯(lián)建站bm7419.com,海內(nèi)外云服務(wù)器15元起步,三天無(wú)理由+7*72小時(shí)售后在線,公司持有idc許可證,提供“云服務(wù)器、裸金屬服務(wù)器、高防服務(wù)器、香港服務(wù)器、美國(guó)服務(wù)器、虛擬主機(jī)、免備案服務(wù)器”等云主機(jī)租用服務(wù)以及企業(yè)上云的綜合解決方案,具有“安全穩(wěn)定、簡(jiǎn)單易用、服務(wù)可用性高、性價(jià)比高”等特點(diǎn)與優(yōu)勢(shì),專為企業(yè)上云打造定制,能夠滿足用戶豐富、多元化的應(yīng)用場(chǎng)景需求。
本文名稱:怎么在C語(yǔ)言中實(shí)現(xiàn)一個(gè)循環(huán)單鏈表功能-創(chuàng)新互聯(lián)
文章網(wǎng)址:http://bm7419.com/article12/djphgc.html
成都網(wǎng)站建設(shè)公司_創(chuàng)新互聯(lián),為您提供網(wǎng)站營(yíng)銷、網(wǎng)站設(shè)計(jì)、手機(jī)網(wǎng)站建設(shè)、網(wǎng)站建設(shè)、建站公司、響應(yīng)式網(wǎng)站
聲明:本網(wǎng)站發(fā)布的內(nèi)容(圖片、視頻和文字)以用戶投稿、用戶轉(zhuǎn)載內(nèi)容為主,如果涉及侵權(quán)請(qǐng)盡快告知,我們將會(huì)在第一時(shí)間刪除。文章觀點(diǎn)不代表本網(wǎng)站立場(chǎng),如需處理請(qǐng)聯(lián)系客服。電話:028-86922220;郵箱:631063699@qq.com。內(nèi)容未經(jīng)允許不得轉(zhuǎn)載,或轉(zhuǎn)載時(shí)需注明來(lái)源: 創(chuàng)新互聯(lián)
猜你還喜歡下面的內(nèi)容