您好,登錄后才能下訂單哦!
本文實(shí)例講述了C語言實(shí)現(xiàn)的雙鏈表功能。分享給大家供大家參考,具體如下:
Dlist.h
#ifndef __DLIST_H__ #define __DLIST_H__ #include<cstdio> #include<malloc.h> #include<assert.h> typedef int ElemType; typedef struct Node { ElemType data; struct Node *prio; struct Node *next; }Node,*PNode; typedef struct List { PNode first; PNode last; size_t size; }List; void InitDlist(List *list);//初始化雙鏈表 void push_back(List *list, ElemType x);//在雙鏈表的末尾插入元素 void push_front(List *list, ElemType x);//在雙鏈表的頭部插入元素 void show_list(List *list);//打印雙鏈表 void pop_back(List *list);//刪除雙鏈表的最后一個(gè)元素 void pop_front(List *list);//刪除雙鏈表的第一個(gè)元素 void insert_val(List *list, ElemType val);//將數(shù)據(jù)元素插入到雙鏈表中(要求此時(shí)雙鏈表中的數(shù)據(jù)元素順序排列) Node* find(List *list, ElemType x);//查找雙鏈表中數(shù)據(jù)值為x的結(jié)點(diǎn) int length(List *list);//求雙鏈表的長度 void delete_val(List *list, ElemType x);//按值刪除雙鏈表中的某個(gè)數(shù)據(jù)元素 void sort(List *list);//對雙鏈表進(jìn)行排序 void reverse(List *list);//逆置雙鏈表 void clear(List *list);//清除雙鏈表 void destroy(List *list);//摧毀雙鏈表 //優(yōu)化 Node* _buynode(ElemType x);//創(chuàng)建結(jié)點(diǎn) #endif
Dlist.cpp
#include"Dlist.h" Node* _buynode(ElemType x) { Node *s = (Node*)malloc(sizeof(Node)); assert(s != NULL); s->data = x; s->prio = s->next = NULL; return s; } void InitDlist(List *list) { Node *s = (Node*)malloc(sizeof(Node)); assert(s != NULL); list->first = list->last = s; list->first->prio = NULL; list->last->next = NULL; list->size = 0; } void push_back(List *list, ElemType x) { Node *s = _buynode(x); s->prio = list->last; list->last->next = s; list->last = s; list->size++; } void push_front(List *list,ElemType x) { Node *s = _buynode(x); if (list->first == list->last) { s->prio = list->first; list->first->next = s; list->last = s; } else { s->next = list->first->next; s->next->prio = s; s->prio = list->first; list->first->next = s; } list->size++; } void show_list(List *list) { Node *p = list->first->next; while (p != NULL) { 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 = NULL; list->size--; } void pop_front(List *list) { if (list->size == 0) return; Node *p = list->first->next; if (list->first->next == list->last) { list->last = list->first; list->last->next = NULL; } else { list->first->next = p->next; p->next->prio = list->first; } free(p); list->size--; } void insert_val(List *list, ElemType x) { Node *p = list->first; while (p->next != NULL && p->next->data < x) p = p->next; if (p->next == NULL) push_back(list, x); else { Node *s = _buynode(x); s->next = p->next; s->next->prio = s; s->prio = p; p->next = s; list->size++; } } Node* find(List *list, ElemType x) { Node *p = list->first->next; while (p!=NULL && p->data != x) p = p->next; 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("要刪除的數(shù)據(jù)不存在!\n"); return; } if (p == list->last) { list->last = p->prio; list->last->next = NULL; } else { p->next->prio = p->prio; p->prio->next = p->next; } free(p); 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 = s; list->last->next = NULL; while (q != NULL) { s = q; q = q->next; Node *p = list->first; while (p->next != NULL && p->next->data < s->data) p = p->next; if (p->next == NULL) { s->next = NULL; s->prio = list->last; list->last->next = s; list->last = s; } else { s->next = p->next; s->next->prio = s; s->prio = p; 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 = p; list->last->next = NULL; while (q != NULL) { p = q; q = q->next; p->next = list->first->next; p->next->prio = p; p->prio = list->first; list->first->next = p; } } void clear(List *list) { if (list->size == 0) return; Node *p = list->first->next; while (p != NULL) { if (p == list->last) { list->last = list->first; list->last->next = NULL; } else { p->next->prio = p->prio; p->prio->next = p->next; } free(p); p = list->first->next; } list->size = 0; } void destroy(List *list) { clear(list); free(list->first); list->first = list->last = NULL; }
main.cpp
#include "Dlist.h" void main() { List mylist; InitDlist(&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("請選擇:>>"); scanf("%d", &select); if (select == 0) break; switch (select) { case 1: printf("請輸入要插入的數(shù)據(jù)(-1結(jié)束):>"); while (scanf("%d", &item), item != -1) { push_back(&mylist, item); } break; case 2: printf("請輸入要插入的數(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("請輸入要插入的數(shù)據(jù):>"); scanf("%d", &item); insert_val(&mylist, item); break; case 7: printf("請輸入要查找的數(shù)據(jù):>"); scanf("%d", &item); p = find(&mylist, item); if (p == NULL) printf("要查找的數(shù)據(jù)在單鏈表中不存在!\n"); break; case 8: printf("單鏈表的長度為%d\n", length(&mylist)); break; case 9: printf("請輸入要刪除的值:>"); 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ò)誤,請重新選擇!\n"); break; } } destroy(&mylist); }
希望本文所述對大家C語言程序設(shè)計(jì)有所幫助。
免責(zé)聲明:本站發(fā)布的內(nèi)容(圖片、視頻和文字)以原創(chuàng)、轉(zhuǎn)載和分享為主,文章觀點(diǎn)不代表本網(wǎng)站立場,如果涉及侵權(quán)請聯(lián)系站長郵箱:is@yisu.com進(jìn)行舉報(bào),并提供相關(guān)證據(jù),一經(jīng)查實(shí),將立刻刪除涉嫌侵權(quán)內(nèi)容。