當(dāng)前位置：首頁 > 编程资源 > 编程问答 >内容正文

编程问答

带头尾指针的list的C实现

發(fā)布時(shí)間：2023/12/10 编程问答 31 豆豆

生活随笔收集整理的這篇文章主要介紹了带头尾指针的list的C实现小編覺得挺不錯(cuò)的,現(xiàn)在分享給大家,幫大家做個(gè)參考.

一、緣起

很早寫了一個(gè)帶頭尾指針的list，該list支持從尾部插入元素，在任意位置刪除元素，最近用這個(gè)list時(shí)發(fā)現(xiàn)一個(gè)bug，修正了，并加了幾個(gè)接口函數(shù)。貼出來，希望對(duì)C的初學(xué)者有用。

二、基本說明

2.1、數(shù)據(jù)結(jié)構(gòu)

l???????? listnode

typedef struct listnode

{

? ? int data;?????????? //you can add any type data here

? ? int id;

? ? struct listnode* next;

} *listnode, _listnode;

其中data、id用于測(cè)試程序，可換成任意數(shù)據(jù)類型。

l???????? list

typedef struct list

{

??? struct listnode* head;

??? struct listnode* tail;

??? int count;?????????? //0 --empty

??? int current_id;

} *list, _list;

head、tail均指向?qū)嶋H元素，list為空時(shí)，指向NULL，current_id用于測(cè)試程序，可去。

2.2、函數(shù)說明

l???????? void list_init(list)

初始化list

l???????? void list_insert(list, listnode)

list的尾部插入元素

l???????? int list_delete(list, listnode)

從list上刪除指定元素，刪除成功返回1，刪除失敗返回0

l???????? void list_poll(list myroot)

遍歷整個(gè)pool，測(cè)試用

l???????? listnode new_listnode(const int id, int data)

構(gòu)建新的元素，并為其分配內(nèi)存

l???????? void delete_listnode(listnode mylistnode)

刪除指定元素，并釋放其內(nèi)存

l???????? listnode find_node_by_data(list myroot, const int data)

根據(jù)data在list上查找匹配的元素

l???????? listnode find_node_by_id(list myroot, const int id)

根據(jù)id在list上查找匹配的元素

三、代碼

3.1、list.h：

/* list.h

** Author: Coon Xu

** Date: 02 Feb 2005

#ifndef LIST_H

#define LIST_H

#include <stdio.h>

#include <stdlib.h>

typedef struct listnode

{

? ? int data;?????????? //you can add any type data here

? ? int id;

? ? struct listnode* next;

} *listnode, _listnode;

typedef struct list

{

??? struct listnode* head;

??? struct listnode* tail;

??? int count;?????????? //0 --empty

??? int current_id;

} *list, _list;

void list_init(list);

void list_insert(list, listnode);

int list_delete(list, listnode);

void list_poll(list myroot);

listnode new_listnode(const int id, int data);

void delete_listnode(listnode mylistnode);

listnode find_node_by_data(list myroot, const int data);

listnode find_node_by_id(list myroot, const int id);

#endif

3.2、list.c：

/* list.c

** Author: Coon Xu

** Date: 02 Feb 2005

#include "list.h"

void list_init(list myroot)

{

??? myroot->count = 0;

??? myroot->head = NULL;

??? myroot->tail = NULL;

??? myroot->current_id = 1;

}

void list_poll(list myroot)

{

??? printf("-------------------------------------------------------/n");

??? listnode p_listnode = myroot->head;

??? while(p_listnode != NULL)

??? {

??????? printf("id: %d/t data: %d/n", p_listnode->id, p_listnode->data);

???????????

??????? p_listnode = p_listnode->next;

??? }

}

//insert node at the tail

void list_insert(list myroot, listnode mylistnode)

{

??? myroot->count++;

???

??? mylistnode->next = NULL;

??? if(myroot->head == NULL)

??? {

??????? myroot->head = mylistnode;

??????? myroot->tail = mylistnode;

??? }

??? else

??? {

??????? myroot->tail->next = mylistnode;

??????? myroot->tail = mylistnode;

??? }???

??? printf("[insert]:/tlist.cout:/t%d/n", myroot->count);

}

int list_delete(list myroot, listnode mylistnode)

{

??? struct listnode* p_listnode = myroot->head;

??? struct listnode* pre_listnode;

???

??? //myroot is empty

??? if(p_listnode == NULL)

??? {

??????? return 0;

??? }

??? //delete head node???

??? if(p_listnode == mylistnode)

??? {

??????? myroot->count--;

??????? //myroot has only one node

??????? if(myroot->tail == mylistnode)

??????? {

??????????? myroot->head = NULL;

??????????? myroot->tail = NULL;

??????? }

??????? else

??????? {

??????????? myroot->head = p_listnode->next;

??????? }

??????? printf("[delete]:/tlist.cout:/t%d/n", myroot->count);

??????? return 1;

??? }

??? while(p_listnode != NULL)

??? {

??????? if(p_listnode == mylistnode)

??????? {

??????????? break;

??????? }

??????? pre_listnode = p_listnode;

??????? p_listnode = p_listnode->next;

??? }

??? if(p_listnode == NULL)

??? {

??????? printf("can not find the node.../n");

??????? return 0;

??? }

??? else

??? {

??????? pre_listnode->next = p_listnode->next;

??????? if(myroot->tail == p_listnode)

??????? {

??????????? myroot->tail = pre_listnode;

??????? }

??????? myroot->count--;

??????? printf("[delete]:/tlist.cout:/t%d/n", myroot->count);

??????? return 1;

??? }?

}

listnode new_listnode(const int id, int data)

{

??? listnode p_listnode = malloc(sizeof(_listnode));

??? p_listnode->id = id;

??? p_listnode->data = data;

???

??? return p_listnode;

}

void delete_listnode(listnode mylistnode)

{

??? mylistnode->next = NULL;

??? free(mylistnode);

??? mylistnode = NULL;

}

listnode find_node_by_data(list myroot, const int data)

{

??? listnode p_listnode = myroot->head;

??? while(p_listnode != NULL)

??? {

??????? if( p_listnode->data == data )

??????? {

??????????? printf("find the node for data: %d/n", data);

??????????? break;

??????? }

??????? p_listnode = p_listnode->next;

??? }

???

??? return p_listnode;

}

listnode find_node_by_id(list myroot, const int id)

{

??? listnode p_listnode = myroot->head;

??? while(p_listnode != NULL)

??? {

??????? if( p_listnode->id == id )

??????? {

??????????? printf("find the node for id: %d/n", id);

??????????? break;

??????? }

??????? p_listnode = p_listnode->next;

??? }

???

??? return p_listnode;

}

3.3、附一個(gè)測(cè)試的主程序

main.c：

#include <stdio.h>

#include <stdlib.h>

#include "list.h"

int main(int argc, char *argv[])

{

??? list mylist = malloc(sizeof(_list));

??? list_init(mylist);

??? int ix = 0;

??? for(ix = 0; ix < 10; ix++)

??? {

??????? listnode my_listnode = new_listnode( (mylist->current_id)++, ix);

??????? list_insert(mylist, my_listnode);

??? }

???

??? list_poll(mylist);

???

??? //delete head node and test

??? listnode my_listnode = find_node_by_id(mylist, 1);

??? list_delete(mylist, my_listnode);

??? delete_listnode(my_listnode);

??? list_poll(mylist);

??? //insert a node and test

??? my_listnode = new_listnode( (mylist->current_id)++, 100);

??? list_insert(mylist, my_listnode);

??? list_poll(mylist);

??? //delete tail node and test

??? my_listnode = find_node_by_id(mylist, 10);

??? list_delete(mylist, my_listnode);

??? delete_listnode(my_listnode);

??? list_poll(mylist);

??? //insert a node and test

??? my_listnode = new_listnode( (mylist->current_id)++, 200);

??? list_insert(mylist, my_listnode);

??? list_poll(mylist);

??? //delete a normal node and test???

??? my_listnode = find_node_by_data(mylist, 6);

??? list_delete(mylist, my_listnode);

??? delete_listnode(my_listnode);

??? list_poll(mylist);

??? //insert a node and test

??? my_listnode = new_listnode( (mylist->current_id)++, 300);

??? list_insert(mylist, my_listnode);

??? list_poll(mylist);

??? //delete head node again and test???

??? my_listnode = find_node_by_id(mylist, 2);

??? list_delete(mylist, my_listnode);

??? delete_listnode(my_listnode);

??? list_poll(mylist);

??? //insert a node and test?

??? my_listnode = new_listnode( (mylist->current_id)++, 400);

??? list_insert(mylist, my_listnode);

??? list_poll(mylist);

???

? system("PAUSE");?

? return 0;

}

總結(jié)

以上是生活随笔為你收集整理的带头尾指针的list的C实现的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。

上一篇：网易云API服务搭建
下一篇：（原创）网吧桌面背景添加文字，转载注明出

编程问答

带头尾指针的list的C实现

一、緣起

二、基本說明

2.1、數(shù)據(jù)結(jié)構(gòu)

2.2、函數(shù)說明

三、代碼

3.1、list.h：

3.2、list.c：

3.3、附一個(gè)測(cè)試的主程序

總結(jié)

二、基本說明

2.1、數(shù)據(jù)結(jié)構(gòu)

2.2、函數(shù)說明

三、代碼

3.1、list.h：

3.3、附一個(gè)測(cè)試的主程序