总结归纳
- 在 DeleteNode 函数中(删除指定结点),如果删除的是最后一个结点,则要特殊处理,需要通过遍历找到该结点的前驱结点,再进行删除操作。
- 循环链表比起单链表,它的优势在于:知道一个结点,就可以知道该结点的前驱结点,以致于所有结点;而单链表必须通过头结点才能得到所有结点,否则无法通过已知结点得到前驱结点。
- 如果你需要频繁的对表头或者表尾操作,那么循环链表很适合,你只需要在表尾置一个尾指针,或者使用循环双链表。
代码实现
#include <iostream>
#include <string>
using namespace std;
struct LNode {
int data;
LNode *next;
};
typedef LNode LNode;
typedef LNode *LinkList;
void InitList(LinkList &L) {
L = new LNode;
L->next = L;
}
bool Empty(LinkList &L) {
if (L->next == L) {
return true;
} else {
return false;
}
}
int GetLength(LinkList &L) {
LNode *p = L->next;
int length = 0;
while (p != L) {
p = p->next;
length++;
}
return length;
}
LinkList List_HeadInsert(LinkList &L) {
int e;
cin >> e;
while (e != 9999) {
LNode *s = new LNode;
s->data = e;
s->next = L->next;
L->next = s;
cin >> e;
}
return L;
}
LinkList List_TailInsert(LinkList &L) {
LNode *r = L;
int e;
cin >> e;
while (e != 9999) {
LNode *s = new LNode;
s->next = r->next;
s->data = e;
r->next = s;
r = s;
cin >> e;
}
r->next = L;
return L;
}
LNode *GetElem(LinkList &L, int i) {
if (i < 0) {
return NULL;
}
LNode *p = L;
int j = 0;
while (p->next != L && j < i) {
p = p->next;
j++;
}
return p;
}
LNode *GetLNode(LinkList &L, int e) {
LNode *p = L->next;
while (p != L && p->data != e) {
p = p->next;
}
return p;
}
LNode *GetPriorNode(LinkList &L, LNode *p) {
LNode *s = L;
while (s->next != p) {
s = s->next;
}
return s;
}
LNode *GetLastNode(LinkList &L) {
LNode *p = L->next;
while (p->next != L) {
p = p->next;
}
return p;
}
bool InsertPriorNode(LNode *p, int e) {
LNode *s = new LNode;
s->next = p->next;
s->data = p->data;
p->next = s;
p->data = e;
return true;
}
bool InsertNextNode(LNode *p, int e) {
LNode *q = new LNode;
q->data = e;
q->next = p->next;
p->next = q;
return true;
}
bool InserstList(LinkList &L, int i, int e) {
if (i < 1) {
return false;
}
LNode *p = GetElem(L, i);
InsertPriorNode(p, 5244);
return true;
}
bool DeleteNode(LinkList &L, LNode *p) {
if (p == L) {
return false;
}
if (p->next == L) {
LNode *s = GetPriorNode(L, p);
s->next = p->next;
delete p;
} else {
LNode *s = new LNode;
s = p->next;
p->data = s->data;
p->next = s->next;
delete s;
}
return true;
}
bool DeleteNextLNode(LinkList &L, LNode *p) {
if (p == NULL || p->next == L) {
return false;
}
LNode *s = new LNode;
s = p->next;
p->next = s->next;
delete s;
return true;
}
bool ListDelte(LinkList &L, int i, int &e) {
if (i < 1) {
return false;
}
LNode *p = GetElem(L, i - 1);
e = p->next->data;
DeleteNextLNode(L, p);
return true;
}
void TraverseList(LinkList &L) {
if (L->next == L) {
return;
}
LNode *p = L->next;
while (p != L) {
cout << p->data << " ";
p = p->next;
}
cout << endl;
}
int main() {
LinkList L;
InitList(L);
cout << Empty(L) << endl;
List_TailInsert(L);
TraverseList(L);
InserstList(L, 3, 5244);
TraverseList(L);
cout << "长度:" << GetLength << endl;
int e = -1;
ListDelte(L, 6, e);
cout << "被删除的值:" << e << endl;
TraverseList(L);
cout << GetElem(L, 5)->next->next->data << endl;
}