双向链表:有两个位置指针,一个指向前一个,一个指向后一个。
头文件:
#ifndef _LINKLIST_H
#define _LINKLIST_H
#define FAILURE 10000
#define SUCCESS 10001
#define TRUE 10002
#define FALSE 10003
typedef int ElemType;
struct node //双向链表
{
ElemType data; //数据域
struct node *next; //指针域 指向下一个
struct node *prior; //指向前一个
};
typedef struct node Node;
int LinkInit(Node **l);
int LinkInsert(Node *l, int n, ElemType e);
int LinkTraverse(Node *l, void (*p)(ElemType));
int LinkLength(Node *l);
int LinkEmpty(Node *l);
int GetElem(Node *l, int p, ElemType *e);
int LocateElem(Node *l, ElemType e, int (*p)(ElemType, ElemType));
int LinkDelete(Node *l, int p, ElemType *e);
int LinkClear(Node *l);
int LinkDestroy(Node **l);
#endif
函数文件:
#include "LinkList.h"
#include <stdlib.h>
#include <stdio.h>
int LinkInit(Node **l)
{
*l = (Node *)malloc(sizeof(Node) * 1); //分配头结点 l 就是头指针
if (NULL == *l)
{
return FAILURE;
}
(*l)->next = NULL; //头结点指针域为空
(*l)->prior = NULL; //双向链表,头结点prior指针为空
return SUCCESS;
}
int LinkInsert(Node *l, int n, ElemType e) //n 插入的位置
{
Node *p = l;
int k = 1; //k 移动的次数
if (NULL == l)
{
return FAILURE;
}
while (k < n && p != NULL)
{
p = p->next;
k++;
}
if (k > n || p == NULL)
{
return FAILURE;
}
Node *q = (Node *)malloc(sizeof(Node) * 1);
if (NULL == q)
{
return FAILURE;
}
q->data = e;
q->prior = p;
q->next = p->next;
p->next = q;
if (NULL != q->next) //如果q不是最后一个结点
{
q->next->prior = q;
}
return SUCCESS;
}
int LinkTraverse(Node *l, void (*p)(ElemType))
{
if (NULL == l)
{
return FAILURE;
}
Node *q = l;
while (q->next)
{
q = q->next;
p(q->data);
}
return SUCCESS;
}
int LinkLength(Node *l)
{
if (NULL == l)
{
return FAILURE;
}
int len = 0;
Node *p = l->next;
while (p)
{
len++;
p = p->next;
}
return len;
}
int LinkEmpty(Node *l)
{
return (l->next == NULL) ? TRUE : FALSE;
}
int GetElem(Node *l, int p, ElemType *e) //p 位置
{
if (NULL == l || p < 1) //入参判断 p不能小于0
{
return FAILURE;
}
Node *q = l;
int i;
for (i = 0; i < p && q != NULL; i++) //循环p次,同时满足q不为空
{
q = q->next;
}
if (!q) //如果q为空,说明p(位置)大于长度
{
return FAILURE;
}
*e = q->data; //q已经指向第p个结点
return SUCCESS;
}
int LocateElem(Node *l, ElemType e, int (*p)(ElemType, ElemType))
{
if (NULL == l)
{
return FAILURE;
}
Node *q = l->next;
int len = 1;
while (q)
{
if (p(e, q->data) == TRUE)
{
return len;
}
q = q->next;
len++;
}
return FAILURE;
}
int LinkDelete(Node *l, int p, ElemType *e)
{
int k = 1;
Node *q = l;
if (l == NULL)
{
return FAILURE;