双向链表的基本操作

双向链表

双向链表也叫双链表，是链表的一种，它的每个数据结点中都有两个指针，分别指向直接后继和直接前驱。
所以，从双向链表中的任意一个结点开始，都可以很方便地访问它的前驱结点和后继结点。

链表结构：
typedef struct Node
{
ElemType data;
Struct Node* prev;
Struct Node* next;
}Node,*DPList;

链表的操作：
初始化链表；
求链表长度；
销毁链表；
元素的操作：
建立新的结点；
元素的插入（头插、尾插、按位置插）；
元素的删除（头删、尾删、按位置删）；

整体结构

DSeqList.h函数的声明

typedef int ElemType;

typedef struct Node
{
 ElemType data;
 struct Node* prev;
 struct Node* next;
}Node,*DPList;
void init(DPList plist);

int getLength(DPList plist);
Node* buyNode(ElemType val);
int insertHead(DPList plist,ElemType val);
int insertTail(DPList plist, ElemType val);
int insertPos(DPList plist,int pos,ElemType val);

int empty(DPList plist);
int deleteHead(DPList plist);
int deleteTail(DPList plist);
int deletePos(DPList plist,int pos);

void Show(DPList plist);

void destory(DPList plist);

代码实现

DSeqList.cpp实现代码

#include<stdio.h>
#include<stdlib.h>
#include"DSeqList.h"
void init(DPList plist)//初始化
{
 if(plist == NULL)
 {
  exit(0);
 }
 plist->prev = NULL;
 plist->next = NULL;
}

Node* buyNode(ElemType val)//建立一个新的结点
{
 Node* pnewnode = (Node*)malloc(sizeof(Node));
 pnewnode->prev = pnewnode->next = NULL;
 pnewnode->data = val;
 return pnewnode;
}

int insertHead(DPList plist,ElemType val)//头插
{
 Node* pnewnode = buyNode(val);
 pnewnode->next = plist->next;
 pnewnode->prev = plist;
 if(plist->next !=NULL)
 {
  plist->next ->prev = pnewnode;
 }
 plist->next = pnewnode;
 return 1;
}

int insertTail(DPList plist, ElemType val)//尾插
{
 Node* pnewnode = buyNode(val);
 Node* pTail = plist;
 while(pTail->next != NULL)
 {
  pTail = pTail->next;
 }
 pTail->next = pnewnode;
 pnewnode->prev = pTail;
 return 1;
}

int getLength(DPList plist)//求链表的长度
{
 int count = 0;
 Node* pCur = plist->next ;
 while(pCur != NULL)
 {
  count++;
  pCur = pCur->next ;
 }
 return count;
}

int insertPos(DPList plist,int pos,ElemType val)//按位置插
{
 Node* pfront = plist;
 int i = 0;
 if(pos<0 || pos>getLength(plist))
 {
  return 0;
 }
 for(i; i<pos; i++)
 {
  pfront = pfront->next ;
 }
 Node* pnewnode = buyNode(val);
 pnewnode->next = pfront->next ;
 pnewnode->prev = pfront;
 if(pfront->next !=NULL)
 {
  pfront->next ->prev = pnewnode;
 }
 pfront->next = pnewnode;
 return 1;
}

void Show(DPList plist)//查
{
 Node* pCur = plist->next ;
 while(pCur != NULL)
 {
  printf("%d ",pCur->data );
  pCur = pCur->next ;
 }
 printf("\n");
}

int empty(DPList plist)//判空
{
 return plist->next == NULL ? 1 :0;
}

int deleteHead(DPList plist)//头删
{
 if(empty(plist))
 {
  return 0;
 }
 Node* pCur = plist->next ;
 plist->next = pCur->next ;
 if(pCur->next != NULL)
 {
  pCur->next->prev = plist;
 }
 free(pCur);
 return 1;
}

int deleteTail(DPList plist)//尾删
{
 if(empty(plist))
 {
  return 0;
 }
 Node* ptail2 = plist;
 Node* pCur = NULL;
 while(ptail2->next != NULL)
 {
  if(ptail2->next ->next == NULL)
  {
   break;
  }
  ptail2 = ptail2->next;
 }
 pCur = ptail2->next ;
 ptail2->next = NULL;
 free(pCur);
 return 1;
}

int deletePos(DPList plist,int pos)//按位置删
{
 if(pos<0 || pos>=getLength(plist))
 {
  return 0;
 }
 Node* pfront = plist;
 Node* pCur = NULL;
 int i = 0;
 for(i; i<pos; i++)
 {
  pfront = pfront->next ;
 }
 pCur = pfront->next ;
 pfront->next = pCur->next ;
 if(pCur->next !=NULL)
 {
  pCur->next->prev = pfront;
 }
 free(pCur);
 return 1;
}

void destory(DPList plist)//销毁函数
{
 Node* pCur = plist->next ;
 Node* pNext = NULL;
 while(pCur !=NULL)
 {
  pNext = pCur->next ;
  delete pCur;
  pCur = pNext;
 }
 plist->next = NULL;
}

代码测试

main.cpp测试程序

#include<stdio.h>
#include"DSeqList.h"

int main()
{
 Node head;
 init(&head);
 for(int i=0; i<3; i++)
 {
  insertHead(&head, i+1);
 }
 for(int i=0; i<3; i++)
 {
  insertTail(&head, i+1);
 }
 Show(&head);
 insertPos(&head, 5, 100);
 Show(&head);
 deleteHead(&head);
 Show(&head);
 deleteTail(&head);
 Show(&head);
 deletePos(&head, 4);
 Show(&head);
 destory(&head);
 Show(&head);
 return 0;
}