下面是迴圈雙連結串列的簡單操作，其中很多細節沒有考慮到，比如沒有判斷空連結串列，目的提供思想，如有出現錯誤，請大家指正！

點選(此處)摺疊或開啟

#include<iostream>
//#include<stdlib.h>
using namespace std;
struct List {
int data;
struct List *last, *next;
};
List *CreateList() {
List *first;
first = new List; //first = (List *)malloc(sizeof(List));
first->next = first;
first->last = first;
return first;
}
List *InitialList(List *first) {
List *p, *head;
head = first;
for (int i = 0; i < 5; i++) {
p = new List;
p->data = i;
p->last = head;
head->next = p;
head = p;
}
first->last = head;
head->next = first;
return first;
}
void PrintList(List *first){
List *q = first;
first = first->next;
cout << "正序列印：";
for (; first != q; first = first->next) {
cout << first->data << " ";
}
cout << endl;
List *p = first;
first = first->last;
cout << "逆序列印：";
for (; first != p; first = first->last) {
cout << first->data << " ";
}
}
void InsertList(List *first,int i,int x) {
List *head, *p;
head = first;
for (int j = 0; j < i - 1; j++) {
head = head->next;
}
p = new List;
p->data = x;
p->last = head;
p->next = head->next; //P
head->next->last = p;
head->next = p; //該過程操作有順序，該步一定要在P之後，否則會覆蓋head ->next
}
void DeleteList(List *first, int i) {
List *head, *p;
head = first;
for (int j = 0; j < i; j++) {
head = head->next;
}
p = head;
head->last->next = head->next; //由於是迴圈雙連結串列，可以直接以刪除點為中心操作
head->next->last = head->last;
delete p;
p = NULL;
first = first->next;
for (; !first; first = first->next) {
cout << first->data << " ";
}
}
void DestoryList(List *first){
List *p, *head;
head = first;
while(head !=first){
p = head;
head = head ->next;
delete p;
}
delete first; //一定要銷燬頭指標
first = NULL; //為了防止出現迷途指標，將頭結點置空
cout << "連結串列已經銷燬" << endl;
exit(0);
}
int main() {
List *s,*t;
s = CreateList();
t = InitialList(s);
DestoryList(t);
//InsertList(t, 3, 11);
//DeleteList(t,4);
PrintList(t);
}

迴圈雙連結串列的簡單操作

相關文章