數據結構：具體的高效有序的管理內存的方法。

1. 鏈表：數據結構的一種 ??節點：每一塊內存? 每一個節點可以是裸指針? 也可以是結構體 ，結合企業鏈表的思路可以將類型強轉，完成高效的訪問。

?

?

main.cc?

// 單向循環鏈表.cpp : 此文件包含 "main" 函數。程序執行將在此處開始并結束。
//
#include<stdlib.h>
#include <iostream>#define CIRCLELINKLIST_TRUE 1
#define CIRCLELINKLIST_FALSE 0typedef struct clinknode {struct clinknode* next;
}clinknode;typedef struct circlelinkist {clinknode head;int size;
}circlelinkist;typedef int(*COMPARE)(clinknode*, clinknode*);typedef void(*PRINTNODE)(clinknode*);circlelinkist* Init_circlelinkist() {circlelinkist* clist = (circlelinkist*)malloc(sizeof(circlelinkist));clist->head.next = &(clist->head);clist->size = 0;return clist;
}void Insert_circlelinkist(circlelinkist* clist, int pos, clinknode* data) {if (clist == NULL) {return;}if (data == NULL) {return;}if (pos<0 || pos>clist->size) {pos = clist->size;}//輔助指針變量clinknode* pcur = &(clist->head);for (int i = 0; i < pos; ++i) {pcur = pcur->next;}data->next = pcur->next;pcur->next = data;clist->size++;
}clinknode* Front_circlelinkist(circlelinkist* clist) {return clist->head.next;
}void RemoveByPos_circlelinkist(circlelinkist* clist, int pos) {if (clist == NULL) {return;}if (pos < 0 || pos >= clist->size) {return;}clinknode* pcur = &(clist->head);for (int i = 0; i < pos; ++i) {pcur = pcur->next;}clinknode* pnext = pcur->next;pcur->next = pnext->next;clist->size--;
}void RemoveByValue_circlelinkist(circlelinkist* clist, clinknode* data, COMPARE compare) {if (clist == NULL) {return;}if (data == NULL) {return;}clinknode* pper = &(clist->head);clinknode* pcur = &(clist->head);for (int i = 0; i < clist->size; ++i) {if (compare(pcur, data) == CIRCLELINKLIST_TRUE) {pper->next = pcur->next;break;}pper = pcur;pcur = pcur->next;}clist->size--;
}int Size_circlelinkist(circlelinkist* clist) {if (clist->size == 0) {return CIRCLELINKLIST_TRUE;}return CIRCLELINKLIST_FALSE;
}int IsEmpty_circlelinkist(circlelinkist* clist) {if (clist->size == 0) {return CIRCLELINKLIST_TRUE;}return CIRCLELINKLIST_FALSE;
}int Find_circlelinkist(circlelinkist* clist, clinknode* data, COMPARE compare) {if (clist == NULL) {return CIRCLELINKLIST_FALSE;}if (data == NULL) {return CIRCLELINKLIST_FALSE;}clinknode* pcur = clist->head.next;int flag = -1;for (int i = 0; i < clist->size; ++i) {if (compare(pcur, data) == CIRCLELINKLIST_TRUE) {flag = i;break;}pcur = pcur->next;}return flag;
}void Print_circlelinkist(circlelinkist* clist, PRINTNODE print) {if (clist == NULL) {return;}clinknode* pcur = clist->head.next;//for (int i = 0; i < clist->size * 3; ++i)for (int i = 0; i < clist->size; ++i) {/* if (pcur == &(clist->head)) {pcur = pcur->next;printf("========================\n");}*/print(pcur);pcur = pcur->next;}
}void Free_circlelinkist(circlelinkist* clist) {if (clist == NULL) {return;}
}typedef struct PERSON {clinknode node;char name[64];int age;
}person;void myprint(clinknode* data) {person* p = (person*)data;printf("name:%s, ?age:%d \n", p->name, p->age);
}int mycompare(clinknode* data1, clinknode* data2) {person* p1 = (person*)data1;person* p2 = (person*)data2;if (strcmp(p1->name,p2->name) == 0 && p1->age == p2->age) {return CIRCLELINKLIST_TRUE;}return CIRCLELINKLIST_FALSE;
}int main()
{circlelinkist* list = Init_circlelinkist();person p1, p2, p3, p4, p5;strcpy_s(p1.name, "aaa");strcpy_s(p2.name, "bbb");strcpy_s(p3.name, "ccc");strcpy_s(p4.name, "ddd");strcpy_s(p5.name, "eee");p1.age = 10;p2.age = 20;p3.age = 30;p4.age = 40;p5.age = 50;Insert_circlelinkist(list, 100, (clinknode*)&p1);Insert_circlelinkist(list, 100, (clinknode*)&p2);Insert_circlelinkist(list, 100, (clinknode*)&p3);Insert_circlelinkist(list, 100, (clinknode*)&p4);Insert_circlelinkist(list, 100, (clinknode*)&p5);Print_circlelinkist(list, myprint);printf("---------------------------\n");person pdel;strcpy_s(pdel.name, "ccc");pdel.age = 30;RemoveByValue_circlelinkist(list,(clinknode*)&pdel,mycompare);Print_circlelinkist(list, myprint);printf("---------------------------\n");Free_circlelinkist(list);system("pause");return 0;
}

?

總結

以上是生活随笔為你收集整理的【C++】【五】循环链表的全部內容，希望文章能夠幫你解決所遇到的問題。

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