首先说一下运行时出现的问题:
以下是使用尾插法创建双链表的过程,这个运行后可以很好的创建。
void CreateListR(DLinkNode* &L, int a[], int n)//尾插法 rear[rɪə(r)]
{
DLinkNode *p;
L = (DLinkNode*)malloc(sizeof(DLinkNode));
L->prior = NULL; L->next = NULL;
DLinkNode *q = L;
for (int i = 0; i < n; i++)
{
p = (DLinkNode*)malloc(sizeof(DLinkNode));
p->data = a[i];
p->prior = q; q->next = p;
q = p;
}q->next = NULL;
}
下面这个会报错:
void CreateListR(DLinkNode* &L, int a[], int n)//尾插法 rear[rɪə(r)]
{
DLinkNode *p,*q=L;
L = (DLinkNode*)malloc(sizeof(DLinkNode));
L->prior = NULL; L->next = NULL;
for (int i = 0; i < n; i++)
{
p = (DLinkNode*)malloc(sizeof(DLinkNode));
p->data = a[i];
p->prior = q; q->next = p;
q = p;
}q->next = NULL;
}
他们的唯一差别就是指针q的定义的顺序,我有点不太明白,出现这样差别的原因是什么,有知道原理的,欢迎大家讨论下,,指点迷津,谢谢了。。
以下是一些操作的全部代码:
#include<stdio.h>
#include<stdlib.h>
#define maxSize 100
typedef struct DNode
{
int data;
struct DNode *prior;// prior[ˈpraɪə(r)]优先的; 占先的; 在…之前;
struct DNode *next;
}DLinkNode;
void CreateListF(DLinkNode* &L, int a[], int n)//头插法建立双链表
{
DLinkNode *p,*q=L;
L = (DLinkNode*)malloc(sizeof(DLinkNode));
L->prior = NULL; L->next = NULL;
for (int i = 0; i < n; i++)
{
p = (DLinkNode*)malloc(sizeof(DLinkNode));
p->data = a[i];
if (L->next != NULL)
L->next->prior = p;
p->next = L->next; p->prior = L;
L->next = p;
}
}
void CreateListR(DLinkNode* &L, int a[], int n)//尾插法 rear[rɪə(r)]
{
DLinkNode *p;
L = (DLinkNode*)malloc(sizeof(DLinkNode));
L->prior = NULL; L->next = NULL;
DLinkNode *q = L;
for (int i = 0; i < n; i++)
{
p = (DLinkNode*)malloc(sizeof(DLinkNode));
p->data = a[i];
p->prior = q; q->next = p;
q = p;
}q->next = NULL;
}
void InitList(DLinkNode* &L)//初始化链表 initiate 英[ɪˈnɪʃieɪt] 开始, 创始,开辟
{
L = (DLinkNode *)malloc(sizeof(DLinkNode));
L->next=L->prior = NULL;
}
void DestroyList(DLinkNode* &L)//销毁线性表 destroy [dɪˈstrɔɪ]杀死; 破坏,摧毁;
{
DLinkNode *p,*q;
p = L;
q = L->next;
while (q!= NULL)
{
free(p);
p = q;
q = q->next;
}
free(p);
}
bool ListEmpty(DLinkNode * L)//判断是否为空表 empty[ˈempti]空的,空虚的,空洞的;
{
return(L->next== NULL);
}
int ListLength(DLinkNode * L)//返回线性表长度
{
DLinkNode *p;
p = L;
int e = 0;
while (p->next != NULL)
{
e++;
p = p->next;
}
return(e);
}
void DispList(DLinkNode* L)//输出线性表
{
if (L->next == NULL)
printf("线性表为空");
DLinkNode *p=L->next;
while (p != NULL)
{
printf("%d ", p->data);
p = p->next;
}printf("\n");
}
bool Getint(DLinkNode *L, int i, int &e)//求线性表中第X个元素的值
{
if (L->next == NULL||i<=0)
return false;
DLinkNode *p = L->next;
int j = 1;
while (j < i)
{
if (p == NULL)
return false;
else
p = p->next;
j++;
}e=p->data;
return true;
}
int Locateint(DLinkNode* L, int e)//按元素值查找,并返回逻辑序号 locate[ləʊˈkeɪt]查找…的地点; 确定…的位置
{
DLinkNode *p = L->next;
int i = 1;
while (p != NULL)
{
if (p->data == e)
return i;
else
{
p = p->next;
i++;
}
}if (p == NULL)return -1;
}
bool ListInsert(DLinkNode* &L, int i, int e)//插入数据元素,为第i个,data值为e
{
DLinkNode *p = L;
int j = 1;
while (p != NULL && j < i)
{
p = p->next;
j++;
}if (p == NULL)
return false;
DLinkNode *q=NULL;
q = (DLinkNode*)malloc(sizeof(DLinkNode));
q->data = e;
q->next = p->next;
p->next->prior = q;
p->next = q; q->prior = p;
return true;
}
bool ListDelete(DLinkNode* &L, int i, int &e)//删除第i个数据元素
{
DLinkNode *p =L;
int j = 1;
while (p != NULL && j < i)
{
p = p->next;
j++;
}if (p == NULL)return false;
DLinkNode *q;
q = p->next;
e = q->data;
p->next=q->next;
q->next->prior = p;
free(q); return true;
}
void reverse(DLinkNode * &L)//reverse[rɪˈvɜ:s]反转; (使)颠倒; 掉换
{
DLinkNode *p=L->next,*q=p->next;
p->next = NULL;
p = q;
q = q->next;
while (p != NULL)
{
p->next = L->next;
L->next->prior = p;
L->next = p;
p->prior = L;
p = q;
if (p == NULL)
break;
else
q = q->next;
}
}
int main()
{
int a[] = { 6,2,5,7,8,3,5,8,9,4 };
DLinkNode* L;
int e;
CreateListF(L,a,10);DispList(L);
printf("双链表元素个数为:%d\n", ListLength(L));
DestroyList(L);
CreateListR(L, a, 10); DispList(L);
printf("双链表元素个数为:%d\n", ListLength(L));
Getint(L, 3, e);
printf("第3个元素为%d\n", e);
printf("数字8在第%d\n", Locateint(L, 8));
ListInsert(L, 3, 99); DispList(L);
ListDelete(L, 3, e);
printf("删除了%d\n", e);
reverse(L); DispList(L);
system("pause");
return 0;
}