快捷導(dǎo)航

C語(yǔ)言實(shí)現(xiàn)單鏈表實(shí)現(xiàn)方法

更新時(shí)間：2017年08月11日 08:31:02 作者：卡哇伊的檸檬

這篇文章主要介紹了C語(yǔ)言實(shí)現(xiàn)單鏈表實(shí)現(xiàn)方法的相關(guān)資料,鏈表分為單向鏈表、雙向鏈表、循環(huán)鏈表，需要的朋友可以參考下

C語(yǔ)言實(shí)現(xiàn)單鏈表實(shí)現(xiàn)方法

鏈表和我們之前實(shí)現(xiàn)過(guò)的順序表一樣，都是簡(jiǎn)單的數(shù)據(jù)結(jié)構(gòu)，鏈表分為單向鏈表、雙向鏈表、循環(huán)鏈表。而單向鏈表又分為兩種實(shí)現(xiàn)方法，一種為帶頭節(jié)點(diǎn)的單鏈表，一種為不帶頭節(jié)點(diǎn)的單鏈表。我們來(lái)具體看看不帶頭節(jié)點(diǎn)的單鏈表的實(shí)現(xiàn)

單鏈表：它是一種鏈?zhǔn)酱鎯?chǔ)的線性表，用一組地址任意的存儲(chǔ)單元存放線性表的數(shù)據(jù)元素，稱存儲(chǔ)單元為一個(gè)節(jié)點(diǎn)。

今天我們來(lái)實(shí)現(xiàn)一些單鏈表的簡(jiǎn)單接口

先看看單鏈表的結(jié)構(gòu)：（為了通用性，我們將類型重命名為DataType）

typedef int DataType;

//鏈表
typedef struct Node
{
  DataType *data;
  struct Node *next;
}Node, *pNode, *pList;

接下來(lái)看看我們要實(shí)現(xiàn)的接口：

void InitLinkList(pList *pplist);//初始化鏈表
pNode BuyNode(DataType d);//創(chuàng)建鏈表節(jié)點(diǎn)
void PushBack(pList *pplist, DataType d);//尾插
void PopBack(pList *pplist);//尾刪
void PushFront(pList *pplist, DataType d);//頭插
void PopFront(pList *pplist);//頭刪
void PrintList(pList plist);//打印鏈表
pNode Find(pList plist, DataType d);//查找指定元素
void Remove(pList *pplist, DataType d);//刪除指定的一個(gè)元素
void RemoveAll(pList *pplist, DataType d);//刪除指定的所有元素
void Insert(pList *pplist, pNode pos, DataType d);//指定位置的后面插入
void Erase(pList *pplist, pNode pos);//指定位置刪除
void DestroyList(pList *pplist);//銷毀鏈表

來(lái)看看每個(gè)接口的具體實(shí)現(xiàn)：

pNode BuyNode(DataType d)
{
  pNode newNode = (pNode)malloc(sizeof(Node));
  if (newNode == NULL)
  {
    perror("malloc");
    exit(EXIT_FAILURE);
  }
  newNode->data = d;
  newNode->next = NULL;
  return newNode;
}
void InitLinkList(pList *pplist)
{
  assert(pplist);
  *pplist = NULL;
}
void PushBack(pList *pplist, DataType d)
{
  assert(pplist);
  pNode newNode = BuyNode(d);
  pNode cur = *pplist;
  //鏈表沒(méi)有節(jié)點(diǎn)
  if (*pplist == NULL)
  {
    *pplist = newNode;
    return;
  }
  //鏈表有節(jié)點(diǎn)
  while (cur->next != NULL)
  {
    cur = cur->next;
  }
  cur->next = newNode;
}
void PopBack(pList *pplist)
{
  pNode cur = *pplist;
  pNode prev = NULL;
  assert(pplist);
  //鏈表沒(méi)有節(jié)點(diǎn)
  if (*pplist == NULL)
  {
    return;
  }
  //鏈表有一個(gè)節(jié)點(diǎn)
  if (cur->next == NULL)
  {
    free(*pplist);
    *pplist = NULL;
    return;
  }
  //鏈表有兩個(gè)及兩個(gè)以上節(jié)點(diǎn)
  while (cur->next != NULL)
  {
    prev = cur;//prev中保存的是cur之前的那個(gè)節(jié)點(diǎn)
    cur = cur->next;
  }
  prev->next = NULL;
  free(cur);
}
void PushFront(pList *pplist, DataType d)
{
  pNode newNode = BuyNode(d);
  //pNode cur = *pplist;
  assert(pplist);
  ////鏈表沒(méi)有節(jié)點(diǎn)
  //if (*pplist == NULL)
  //{
  // *pplist = newNode;
  //}
  ////鏈表有節(jié)點(diǎn)
  newNode->next = *pplist;
  *pplist = newNode;

}
void PopFront(pList *pplist)
{
  pNode cur = *pplist;
  assert(pplist);
  //鏈表為空
  if (*pplist == NULL)
  {
    return;
  }
  *pplist = cur->next;
  free(cur);
  cur = NULL;
}
void PrintList(pList plist)
{
  pNode cur = plist;
  while (cur)
  {
    printf("%d-->", cur->data);
    cur = cur->next;
  }
  printf("NULL\n");
}
pNode Find(pList plist, DataType d)
{
  pNode cur = plist;
  while (cur)
  {
    if (cur->data == d)
    {
      return cur;
    }
    cur = cur->next;
  }
  return NULL;
}
void Remove(pList *pplist, DataType d)
{
  pNode cur = *pplist;
  pNode prev = NULL;
  assert(pplist);
  if (cur == NULL)
  {
    return;
  }
  while (cur)
  {
    if (cur->data == d)
    {
      pNode del = cur;
      if (cur == *pplist)
      {
        *pplist = cur->next;
      }
      prev->next = cur->next;
      free(del);
      del = NULL;
      return;
    }
    else
    {
      prev = cur;
      cur = cur->next;
    }
  }
}
void RemoveAll(pList *pplist, DataType d)
{
  pNode cur = *pplist;
  pNode prev = NULL;
  assert(pplist);
  if (*pplist == NULL)
  {
    return;
  }
  while (cur)
  {
    if (cur->data == d)
    {
      pNode del = cur;
      if (cur == *pplist)
      {
        *pplist = cur->next;
      }
      else
      {
        prev->next = cur->next;
      }
      cur = cur->next;
      free(del);
      del = NULL;
    }
    else
    {
      prev = cur;
      cur = cur->next;
    }
  }

}
//在pos后面插入一個(gè)元素
void Insert(pList *pplist, pNode pos, DataType d)
{
  pNode newNode = BuyNode(d);
  assert(pplist);
  assert(pos);
  if (*pplist == NULL)
  {
    PushFront(pplist, d);
    return;
  }
  newNode->next = pos->next;
  pos->next = newNode;
}
void Erase(pList *pplist, pNode pos)
{
  assert(pplist);
  assert(pos);
  //要?jiǎng)h除的是尾節(jié)點(diǎn)
  if (pos->next == NULL)
  {
    PopBack(pplist);
  }
  //刪除的是非尾節(jié)點(diǎn)
  else
  {
    pNode del = pos->next;
    pos->data = pos->next->data;
    pos->next = pos->next->next;
    free(del);
    del = NULL;
  }
}
void DestroyList(pList *pplist)
{
  assert(pplist);
  pNode cur = *pplist;
  while (cur)
  {
    pNode del = cur;
    cur = cur->next;
    printf("del:%d\n", del->data);
    free(del);
    del = NULL;
  }
}

由于這些接口都較為簡(jiǎn)單，所以不進(jìn)行具體的測(cè)試展示，讀者可以自行測(cè)試

以上就是C語(yǔ)言實(shí)現(xiàn)單鏈表實(shí)現(xiàn)方法，如有疑問(wèn)請(qǐng)留言或者到本站社區(qū)交流討論，感謝閱讀，希望能幫助到大家，謝謝大家對(duì)本站的支持！

您可能感興趣的文章: