C語言實(shí)現(xiàn)的雙鏈表功能完整示例
更新時(shí)間：2018年04月30日 13:11:54 作者：Tom文星
這篇文章主要介紹了C語言實(shí)現(xiàn)的雙鏈表功能,結(jié)合完整實(shí)例形式分析了基于C語言實(shí)現(xiàn)的雙鏈表定義、添加、刪除、排序等相關(guān)操作實(shí)現(xiàn)技巧,需要的朋友可以參考下
本文實(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);//對(duì)雙鏈表進(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("要?jiǎng)h除的數(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("請(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("單鏈表的長度為%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);
}
希望本文所述對(duì)大家C語言程序設(shè)計(jì)有所幫助。
相關(guān)文章
這篇文章主要為大家介紹了如何利用C語言實(shí)現(xiàn)原神抽卡的小游戲，具有一定的參考價(jià)值，感興趣的小伙伴們可以參考一下，希望能夠給你帶來幫助2022-04-04
C語言小項(xiàng)目計(jì)時(shí)器的實(shí)現(xiàn)思路(倒計(jì)時(shí)+報(bào)警提示)
這篇文章主要介紹了C語言小項(xiàng)目計(jì)時(shí)器（倒計(jì)時(shí)+報(bào)警提示）的實(shí)現(xiàn)思路，本文給大家介紹的非常詳細(xì)，對(duì)大家的學(xué)習(xí)或工作具有一定的參考借鑒價(jià)值,需要的朋友可以參考下2021-11-11
今天小編就為大家分享一篇淺談C++的幾種從鍵盤輸入方式，具有很好的參考價(jià)值，希望對(duì)大家有所幫助。一起跟隨小編過來看看吧2018-07-07
大家好，本篇文章主要講的是C++中的拷貝構(gòu)造函數(shù)詳解，感興趣的同學(xué)趕快來看一看吧，對(duì)你有幫助的話記得收藏一下2022-02-02
這篇文章主要介紹了堆排序算法(選擇排序改進(jìn))，有需要的朋友可以參考一下2014-01-01
本文主要介紹C語言 共用體,這里整理了相關(guān)資料及示例代碼，幫助大家學(xué)習(xí)理解此部分的知識(shí)，有興趣的小伙伴可以參考下2016-08-08
C語言數(shù)據(jù)結(jié)構(gòu)之單鏈表與雙鏈表的增刪改查操作實(shí)現(xiàn)
這篇文章主要為大家詳細(xì)介紹了C語言數(shù)據(jù)結(jié)構(gòu)中單鏈表與雙鏈表的增刪改查操作的實(shí)現(xiàn)，相信大家如果搞懂了本文內(nèi)容，應(yīng)對(duì)復(fù)雜的鏈表類的題也就能慢慢鉆研了2022-07-07
這篇文章主要介紹了15種?C++?常見報(bào)錯(cuò),本文通過實(shí)例代碼給大家講解的非常詳細(xì)，對(duì)大家的學(xué)習(xí)或工作具有一定的參考借鑒價(jià)值，需要的朋友可以參考下2023-01-01
這篇文章給大家介紹了Qt調(diào)用MATLAB引擎混合編程的全過程,文中通過圖文結(jié)合的方式給大家介紹的非常詳細(xì),對(duì)大家的學(xué)習(xí)或工作有一定的幫助,需要的朋友可以參考下2024-01-01
C++11/14 線程調(diào)用類對(duì)象和線程傳參的方法
這篇文章主要介紹了C++11/14 線程調(diào)用類對(duì)象和線程傳參的方法，小編覺得挺不錯(cuò)的，現(xiàn)在分享給大家，也給大家做個(gè)參考。一起跟隨小編過來看看吧2019-01-01