1、头指针法
#include "stdio.h"
#define OK 1
#define ERROR 0
#define TRUE 1
#define FALSE 0
#define MAXSIZE 20
typedef int Status;
typedef int ElemType;
Status visit(ElemType c)
{
printf("%d ", c);
return OK;
}
typedef struct Node
{
ElemType data;
struct Node* next;
}Node;
typedef struct Node* LinkLoopList;
Status InitList(LinkLoopList* L)
{
*L = new Node();
(*L)->next = (*L);
return OK;
}
Status ListEmpty(const LinkLoopList *L)
{
if ((*L)->next != (*L))
return FALSE;
else
return TRUE;
}
Status ClearList(LinkLoopList* L)
{
LinkLoopList p, q;
p = (*L)->next;
while (p != (*L))
{
q = p->next;
delete p;
p = q;
}
(*L)->next = (*L);
return OK;
}
const int ListLength( LinkLoopList *L)
{
int i = 0;
LinkLoopList p = (*L)->next;
while (p != (*L))
{
i++;
p = p->next;
}
return i;
}
Status GetElem(LinkLoopList *L, int i, ElemType* e)
{
int j = 1;
LinkLoopList p;
p = (*L)->next;
while ((p != (*L)) && j < i)
{
p = p->next;
j++;
}
if ((p == (*L)) || j > i)
return ERROR;
*e = p->data;
return OK;
}
int LocateElem(LinkLoopList *L, ElemType e)
{
int i = 0;
LinkLoopList p = (*L)->next;
while (p != (*L))
{
i++;
if (p->data == e)
return i;
p = p->next;
}
return 0;
}
Status ListInsert(LinkLoopList* L, int i, ElemType e)
{
LinkLoopList N = new Node();
N->data = e;
int j = 1;
LinkLoopList p = *L;
while ((j < i) && (p->next != (*L)))
{
p = p->next;
j++;
}
if ((j < i) && (!(p != (*L))))
return ERROR;
N->next = p->next;
p->next = N;
}
Status ListDelete(LinkLoopList* L, int i, ElemType* e)
{
int j = 1;
LinkLoopList p = (*L);
LinkLoopList q;
while ((p->next != (*L)) && (j < i))
{
p = p->next;
j++;
}
if (!(p->next != (*L)) )
return ERROR;
*e = p->next->data;
q = p->next;
p->next = p->next->next;
delete q;
return OK;
}
const Status ListTraverse(LinkLoopList *L)
{
LinkLoopList p = (*L)->next;
while (p != (*L))
{
visit(p->data);
p = p->next;
}
printf("\n");
return OK;
}
void CreateListTail(LinkLoopList* L, int n)
{
LinkLoopList p = *L;
for (int i = 0; i < n; i++)
{
Node* N = new Node();
N->data = i;
p->next = N;
p = p->next;
p->next = *L;
}
}
void CreateListHead(LinkLoopList* L, int n)
{
LinkLoopList p = (*L)->next;
for (int i = 0; i < n; i++)
{
Node* N = new Node();
N->data = i;
N->next = p;
(*L)->next = N;
p = N;
}
}
int main()
{
LinkLoopList L = NULL;
ElemType e;
Status i;
int j;
int k;
i = InitList(&L);
printf("初始化后:ListLength(L) = %d \n", ListLength(&L));
for (int j = 1; j <= 5; j++)
{
int i = ListInsert(&L, 1, j);
}
printf("在L的表头依次插入1~5后:ListLength(L) = %d \n", ListLength(&L));
ListTraverse(&L);
printf("ListLength(L)=%d \n", ListLength(&L));
i = ListEmpty(&L);
printf("L是否空:i=%d(1:是 0:否)\n", i);
i = ClearList(&L);
printf("清空L后:ListLength(L)=%d\n", ListLength(&L));
i = ListEmpty(&L);
printf("L是否空:i=%d(1:是 0:否)\n", i);
for (int j = 1; j <= 10; j++)
ListInsert(&L, j, j);
printf("在L的表尾依次插入1~10后:L.data=");
ListTraverse(&L);
printf("ListLength(L)=%d \n", ListLength(&L));
ListInsert(&L, 1, 0);
printf("在L的表头插入0后:L.data=");
ListTraverse(&L);
printf("ListLength(L)=%d \n", ListLength(&L));
GetElem(&L, 5, &e);
printf("第5个元素的值为:%d\n", e);
for (int j = 3; j <= 4; j++)
{
k = LocateElem(&L, j);
if (k)
printf("第%d个元素的值为%d\n", k, j);
else
printf("没有值为%d的元素\n", j);
}
k = ListLength(&L);
for (int j = k + 1; j >= k; j--)
{
i = ListDelete(&L, j, &e);
if (i == ERROR)
printf("删除第%d个数据失败\n", j);
else
printf("删除第%d个的元素值为:%d\n", j, e);
}
printf("依次输出L的元素:");
ListTraverse(&L);
j = 5;
ListDelete(&L, j, &e);
printf("删除第%d个的元素值为:%d\n", j, e);
printf("依次输出L的元素:");
ListTraverse(&L);
i = ClearList(&L);
printf("\n清空L后:ListLength(L)=%d\n", ListLength(&L));
CreateListHead(&L, 20);
printf("整体创建L的元素(头插法):");
ListTraverse(&L);
i = ClearList(&L);
printf("\n删除L后:ListLength(L)=%d\n", ListLength(&L));
CreateListTail(&L, 20);
printf("整体创建L的元素(尾插法):");
ListTraverse(&L);
}