代码是用C语言写的,但是bool类型的输出是用C++的cout写的。因为对于布尔类型,C++可以返回true或false,C只能返回1或0。
有头结点的双链表
#include<iostream>
using namespace std;
#include<malloc.h>
typedef int ElemType;
typedef struct DNode
{
ElemType data;
struct DNode* prior;
struct DNode* next;
}DNode, * DLinkList;
bool InitDList(DLinkList& L) //初始化单链表
{
L = (DNode*)malloc(sizeof(DNode)); //分配一个头结点
if (L == NULL) return false; //内存不足,分配失败
L->prior = NULL; //头结点的prior永远指向NULL
L->next = NULL; //头结点之后暂时还没有结点
return true;
}
bool DLinkListEmpty(DLinkList& L) //判断双链表是否为空表
{
return (L->next == NULL);
}
void CreateListF(DLinkList& L) //头插法创建双链表
{
DNode* s;
int num;
printf("输入:\n"); //键盘随机输入
scanf("%d", &num);
while (num != 999)
{
s = (DNode*)malloc(sizeof(DNode));
s->data = num;
s->next = L->next;
if (L->next != NULL) s->next->prior = s;
s->prior = L;
L->next = s;
scanf("%d", &num);
}
}
void CreateListR(DLinkList& L) //尾插法创建单链表
{
DNode* s, * r = L;
for (int i = 0; i < 10; i++) //循环固定输入
{
s = (DNode*)malloc(sizeof(DNode));
s->data = i;
r->next = s;
s->prior = r;
r = s;
}
r->next = NULL;
}
void PrintDList(DLinkList& L) //输出函数
{
DNode* p = L->next;
while (p != NULL)
{
printf("%d ", p->data);
p = p->next;
}
}
int DListLength(DLinkList L)
{
DNode* p = L->next;
int n = 0;
while (p != NULL)
{
n++;
p = p->next;
}
return n;
}
bool DListInsertR(DLinkList& L, int i, ElemType e)
{
DNode* p = L, * s;
int j = 0;
if (i <= 0 || p->next == NULL) return false;
while (p != NULL && j < i)
{
j++;
p = p->next;
}
if (p == NULL) return false;
else
{
s = (DNode*)malloc(sizeof(DNode));
s->data = e;
s->next = p->next;
if (p->next != NULL)
p->next->prior = s;
s->prior = p;
p->next = s;
return true;
}
}
bool DListInsertF(DLinkList& L, int i, ElemType e)
{
DNode* p = L, * s;
int j = 0;
if (i <= 0 || p->next == NULL) return false; //i输入错误或者双链表只有一个头结点
while (p != NULL && j < i)
{
j++;
p = p->next;
}
if (p == NULL) return false;
else
{
s = (DNode*)malloc(sizeof(DNode));
s->data = e;
s->prior = p->prior;
p->prior->next = s;
s->next = p;
p->prior = s;
return true;
}
}
bool DListDelete(DLinkList& L, int i, ElemType& e)
{
DNode* p = L;
int j = 0;
e = -999; //删除失败时,e的值返回-999
if (i <= 0 || p->next == NULL) return false;
while (p != NULL && j < i)
{
j++;
p = p->next;
}
if (p == NULL) return false;
else
{
e = p->data;
p->prior->next = p->next;
if (p->next != NULL)
p->next->prior = p->prior;
free(p);
return true;
}
}
bool DListDeleteR(DLinkList& L, int i, ElemType& e)
{
DNode* p = L, * n;
int j = 0;
e = -999; //删除失败时,e的值返回-999
if (i <= 0 || p->next == NULL) return false;
while (p != NULL && j < i)
{
j++;
p = p->next;
}
if (p == NULL) return false;
else
{
if (p->next == NULL) return false; //i是最后一个结点
e = p->next->data;
n = p->next; //i的后一个结点
p->next = n->next;
if (n->next != NULL) //i的后面只有最后一个结点
n->next->prior = p;
free(n);
return true;
}
}
bool DListDeleteF(DLinkList& L, int i, ElemType& e)
{
DNode* p = L, * pre;
int j = 0;
e = -999; //删除失败时,e的值返回-999
if (i <= 0 || p->next == NULL) return false;
while (p != NULL && j < i)
{
j++;
p = p->next;
}
if (p == NULL) return false;
else
{
if (i == 1) return false; //i是首结点,除头结点外没有前驱结点
pre = p->prior;
e = pre->data;
pre->prior->next = p;
p->prior = pre->prior;
free(pre);
return true;
}
}
bool GetElem(DLinkList& L, int i, ElemType& e)
{
DNode* p = L;
int j = 0;
e = -999; //查找失败,e返回-999
if (i <= 0 || p == NULL) return false; //参数错误
while (p != NULL && j < i)
{
j++;
p = p->next;
}
if (p == NULL) return false; //不存在第i个位置
else
{
e = p->data;
return true;
}
}
int LocateElem(DLinkList& L, ElemType e)
{
DNode* p = L->next;
int j = 1;
while (p != NULL && p->data != e)
{
j++;
p = p->next;
}
if (p == NULL) return -999; //不存在第i个位置
else return j;
}
int main()
{
DLinkList L;
InitDList(L); //初始化单链表
cout << boolalpha << "双链表现在为空吗?-" << DLinkListEmpty(L) << endl;
printf("\n");
CreateListR(L); //尾插法创建单链表
cout << boolalpha << "双链表现在为空吗?-" << DLinkListEmpty(L) << endl;
printf("\n");
printf("双链表L中的各值为:");
PrintDList(L); //调用函数,输出单链表L
printf("\n");
printf("双链表的长度为:%d\n\n", DListLength(L));
ElemType num;
int number = 2;
printf("(按位查找)查找第%d个位置的值:\n", number);
cout << boolalpha << "查找成功了吗?—" << GetElem(L, 2, num) << endl;
printf("该位置的值为:%d\n\n", num);
printf("(按元素值查找)查找值为%d的元素位置:\n", number);
printf("该元素第一次出现的位置是:%d\n\n", LocateElem(L, 2));
printf("在第%d个位置后插入一个结点:\n", number);
cout << boolalpha << "插入成功了吗?-" << DListInsertR(L, 2, 8) << endl;
printf("插入后双链表L中的各值为:");
PrintDList(L); //调用函数,输出单链表L
printf("\n");
printf("插入后双链表的长度为:%d\n\n", DListLength(L));
printf("在第%d个位置前插入一个结点:\n", number);
cout << boolalpha << "插入成功了吗?-" << DListInsertF(L, 2, 8) << endl;
printf("插入后双链表L中的各值为:");
PrintDList(L); //调用函数,输出单链表L
printf("\n");
printf("插入后双链表的长度为:%d\n\n", DListLength(L));
ElemType num1;
printf("删除第%d个位置的结点:\n", number);
cout << boolalpha << "删除成功了吗?-" << DListDelete(L, 2, num1) << endl;
printf("删除的值为:%d\n", num1);
printf("删除后双链表L中的各值为:");
PrintDList(L); //调用函数,输出单链表L
printf("\n");
printf("删除后双链表的长度为:%d\n\n", DListLength(L));
ElemType num2;
printf("删除第%d个位置的后一个结点:\n", number);
cout << boolalpha << "删除成功了吗?-" << DListDeleteR(L, 2, num2) << endl;
printf("删除的值为:%d\n", num2);
printf("删除后双链表L中的各值为:");
PrintDList(L); //调用函数,输出单链表L
printf("\n");
printf("删除后双链表的长度为:%d\n\n", DListLength(L));
ElemType num3;
printf("删除第%d个位置的前一个结点:\n", number);
cout << boolalpha << "删除成功了吗?-" << DListDeleteF(L, 2, num3) << endl;
printf("删除的值为:%d\n", num3);
printf("删除后双链表L中的各值为:");
PrintDList(L); //调用函数,输出单链表L
printf("\n");
printf("删除后双链表的长度为:%d\n\n", DListLength(L));
return 0;
}
- 运行结果:
无头结点的双链表
#include<iostream>
using namespace std;
#include<malloc.h>
typedef int ElemType;
typedef struct DNode
{
ElemType data;
struct DNode* prior;
struct DNode* next;
}DNode, * DLinkList;
void InitDList(DLinkList& L) //初始化双链表
{
L = NULL;
}
bool DLinkListEmpty(DLinkList& L) //判断双链表是否为空表
{
return (L == NULL);
}
void CreateListF(DLinkList& L) //头插法创建双链表
{
DNode* s = L, * p;
int num;
printf("输入:\n"); //键盘随机输入
scanf("%d", &num);
while (num != 999)
{
s = (DNode*)malloc(sizeof(DNode));
s->data = num;
if (L == NULL)
{
L = s;
s->next = NULL;
s->prior = NULL;
p = s;
}
else
{
s->next = L;
L->prior = s;
L = s;
}
scanf("%d", &num);
L->prior = NULL;
}
}
void CreateListR(DLinkList& L) //尾插法创建双链表
{
DNode* s, * r = L;
for (int i = 0; i < 10; i++) //循环固定输入
{
s = (DNode*)malloc(sizeof(DNode));
s->data = i;
if (L == NULL)
{
L = s;
s->next = NULL;
s->prior = NULL;
r = s;
}
else
{
r->next = s;
s->prior = r;
r = r->next;
}
}
r->next = NULL;
}
void PrintDList(DLinkList& L) //输出函数
{
DNode* p = L;
while (p != NULL)
{
printf("%d ", p->data);
p = p->next;
}
}
int DListLength(DLinkList L) //求双链表当前的长度
{
DNode* p = L;
int n = 0;
while (p != NULL)
{
n++;
p = p->next;
}
return n;
}
bool GetElem(DLinkList& L, int i, ElemType& e) //按元素值查找
{
DNode* p = L;
int j = 1;
e = -999; //查找失败,e返回-999
if (i <= 0 || p == NULL) return false; //参数错误
while (p != NULL && j < i)
{
j++;
p = p->next;
}
if (p == NULL) return false; //不存在第i个位置
else
{
e = p->data;
return true;
}
}
int LocateElem(DLinkList& L, ElemType e) //按位查找
{
DNode* p = L;
int j = 1;
while (p != NULL && p->data != e)
{
j++;
p = p->next;
}
if (p == NULL) return -999; //不存在第i个位置
else return j;
}
bool DListInsertR(DLinkList& L, int i, ElemType e) //第i个位置后插入s结点
{
DNode* p = L, * s;
int j = 1;
if (i <= 0 || p == NULL) return false;
while (p != NULL && j < i)
{
j++;
p = p->next;
}
if (p == NULL) return false;
else
{
s = (DNode*)malloc(sizeof(DNode));
s->data = e;
s->next = p->next;
if (p->next != NULL) //第i个结点的下一个结点为NULL
p->next->prior = s;
s->prior = p;
p->next = s;
return true;
}
}
bool DListInsertF(DLinkList& L, int i, ElemType e) //在第i个位置前插入结点s
{
DNode* p = L, * s;
int j = 1;
if (i <= 0 || p == NULL) return false; //i输入错误或者双链表只有一个结点
while (p != NULL && j < i) //找第i个位置
{
j++;
p = p->next;
}
if (p == NULL) return false; //i个位置不存在
else
{
s = (DNode*)malloc(sizeof(DNode)); //开辟s结点的存储空间
s->data = e; //s结点的数据域为e的值
if (p->prior == NULL) //i是首结点(i=1)
{
s->next = p; //将结点s连接到L之前
p->prior = s;
L = s; //L指向s结点
}
else //如果i不是首结点(i≠1)
{
s->prior = p->prior;
p->prior->next = s;
s->next = p;
p->prior = s;
}
return true;
}
}
bool DListDelete(DLinkList& L, int i, ElemType& e) //删除第i个位置的结点
{
DNode* p = L, * pre;
int j = 1;
e = -999; //删除失败时,e的值返回-999
if (i <= 0 || p == NULL) return false; //参数错误
while (p != NULL && j < i)
{
j++;
p = p->next;
}
if (p == NULL) return false;
else
{
e = p->data;
if (i == 1) L = p->next; //如果i是首结点(i=1),L指向p的下一个节点
else
{
p->prior->next = p->next;
if (p->next != NULL) //如果p的后一个结点为NULL
p->next->prior = p->prior;
}
free(p); //释放i位置的结点
return true;
}
}
bool DListDeleteR(DLinkList& L, int i, ElemType& e) //删除第i个位置的后一个结点
{
DNode* p = L, * n;
int j = 1;
e = -999; //删除失败时,e的值返回-999
if (i <= 0 || p == NULL) return false;
while (p != NULL && j < i)
{
j++;
p = p->next;
}
if (p == NULL) return false;
else
{
if (p->next == NULL) return false; //i是最后一个结点
e = p->next->data;
n = p->next; //i的后一个结点
p->next = n->next;
if (n->next != NULL) //i的后面只有最后一个结点
n->next->prior = p;
free(n);
return true;
}
}
bool DListDeleteF(DLinkList& L, int i, ElemType& e) //删除第i个位置的前一个结点
{
DNode* p = L, * pre;
int j = 1;
e = -999; //删除失败时,e的值返回-999
if (i <= 1 || p == NULL) return false; //如果i是首结点,则不存在前一个结点
while (p != NULL && j < i) //找第i个位置
{
j++;
p = p->next;
}
if (p == NULL) return false; //不存在第i个位置
else
{
pre = p->prior; //第i个位置的前一个结点
e = pre->data;
if (pre->prior == NULL) L = p; //如果i=2,让L指向第二个结点
else
{
pre->prior->next = p;
p->prior = pre->prior;
}
free(pre); //释放结点空间
return true;
}
}
int main()
{
DLinkList L;
InitDList(L); //初始化单链表
cout << boolalpha << "双链表现在为空吗?—" << DLinkListEmpty(L) << endl;
printf("\n");
CreateListF(L); //头插法创建单链表
cout << boolalpha << "双链表现在为空吗?—" << DLinkListEmpty(L) << endl;
printf("\n");
printf("双链表L中的各值为:");
PrintDList(L); //调用函数,输出单链表L
printf("\n");
printf("双链表的长度为:%d\n\n", DListLength(L));
ElemType num;
int number = 2;
printf("(按位查找)查找第%d个位置的值:\n", number);
cout << boolalpha << "查找成功了吗?—" << GetElem(L, 2, num) << endl;
printf("该位置的值为:%d\n\n", num);
printf("(按元素值查找)查找值为%d的元素位置:\n", number);
printf("该元素第一次出现的位置是:%d\n\n", LocateElem(L, 2));
printf("在第%d个位置后插入一个结点:\n", number);
cout << boolalpha << "插入成功了吗?—" << DListInsertR(L, 2, 8) << endl;
printf("插入后双链表L中的各值为:");
PrintDList(L); //调用函数,输出单链表L
printf("\n");
printf("插入后双链表的长度为:%d\n\n", DListLength(L));
printf("在第%d个位置前插入一个结点:\n", number);
cout << boolalpha << "插入成功了吗?—" << DListInsertF(L, 2, 8) << endl;
printf("插入后双链表L中的各值为:");
PrintDList(L); //调用函数,输出单链表L
printf("\n");
printf("插入后双链表的长度为:%d\n\n", DListLength(L));
ElemType num1;
printf("删除第%d个位置的结点:\n", number);
cout << boolalpha << "删除成功了吗?—" << DListDelete(L, 2, num1) << endl;
printf("删除的值为:%d\n", num1);
printf("删除后双链表L中的各值为:");
PrintDList(L); //调用函数,输出单链表L
printf("\n");
printf("删除后双链表的长度为:%d\n\n", DListLength(L));
ElemType num2;
printf("删除第%d个位置的后一个结点:\n", number);
cout << boolalpha << "删除成功了吗?—" << DListDeleteR(L, 2, num2) << endl;
printf("删除的值为:%d\n", num2);
printf("删除后双链表L中的各值为:");
PrintDList(L); //调用函数,输出单链表L
printf("\n");
printf("删除后双链表的长度为:%d\n\n", DListLength(L));
ElemType num3;
printf("删除第%d个位置的前一个结点:\n", number);
cout << boolalpha << "删除成功了吗?—" << DListDeleteF(L, 2, num3) << endl;
printf("删除的值为:%d\n", num3);
printf("删除后双链表L中的各值为:");
PrintDList(L); //调用函数,输出单链表L
printf("\n");
printf("删除后双链表的长度为:%d\n\n", DListLength(L));
return 0;
}
- 运行结果: