链式存储队列

来源：互联网发布：淘宝天猫贴吧论坛编辑：程序博客网时间：2024/05/18 00:41

#ifndef _LINKLIST_H_#define _LINKLIST_H_typedef void LinkList;typedef struct _tag_LinkListNode LinkListNode;struct _tag_LinkListNode{    LinkListNode* next;};LinkList* LinkList_Create();void LinkList_Destroy(LinkList* list);void LinkList_Clear(LinkList* list);int LinkList_Length(LinkList* list);int LinkList_Insert(LinkList* list, LinkListNode* node, int pos);LinkListNode* LinkList_Get(LinkList* list, int pos);LinkListNode* LinkList_Delete(LinkList* list, int pos);#endif

<pre name="code" class="html">#ifndef _QUEUELIST_H#define _QUEUELIST_Htypedef void LinkQueue;LinkQueue* LinkQueue_Create();void LinkQueue_Destroy(LinkQueue* queue);void LinkQueue_Clear(LinkQueue* queue);int LinkQueue_Append(LinkQueue* queue, void* item);void* LinkQueue_Retrieve(LinkQueue* queue);void* LinkQueue_Header(LinkQueue* queue);int LinkQueue_Length(LinkQueue* queue);#endif

<pre name="code" class="html">#include <stdio.h>#include <malloc.h>#include "LinkList.h"typedef struct _tag_LinkList{    LinkListNode header;    int length;} TLinkList;LinkList* LinkList_Create() // O(1){    TLinkList* ret = (TLinkList*)malloc(sizeof(TLinkList));        if( ret != NULL )    {        ret->length = 0;        ret->header.next = NULL;    }        return ret;}void LinkList_Destroy(LinkList* list) // O(1){    free(list);}void LinkList_Clear(LinkList* list) // O(1){    TLinkList* sList = (TLinkList*)list;        if( sList != NULL )    {        sList->length = 0;        sList->header.next = NULL;    }}int LinkList_Length(LinkList* list) // O(1){    TLinkList* sList = (TLinkList*)list;    int ret = -1;        if( sList != NULL )    {        ret = sList->length;    }        return ret;}int LinkList_Insert(LinkList* list, LinkListNode* node, int pos) // O(n){     TLinkList* sList = (TLinkList*)list;    int ret = (sList != NULL) && (pos >= 0) && (node != NULL);    int i = 0;        if( ret )    {        LinkListNode* current = (LinkListNode*)sList;                for(i=0; (i<pos) && (current->next != NULL); i++)        {            current = current->next;        }                node->next = current->next;        current->next = node;                sList->length++;    }        return ret;}LinkListNode* LinkList_Get(LinkList* list, int pos) // O(n){    TLinkList* sList = (TLinkList*)list;    LinkListNode* ret = NULL;    int i = 0;        if( (sList != NULL) && (0 <= pos) && (pos < sList->length) )    {        LinkListNode* current = (LinkListNode*)sList;                for(i=0; i<pos; i++)        {            current = current->next;        }                ret = current->next;    }        return ret;}LinkListNode* LinkList_Delete(LinkList* list, int pos) // O(n){    TLinkList* sList = (TLinkList*)list;    LinkListNode* ret = NULL;    int i = 0;        if( (sList != NULL) && (0 <= pos) && (pos < sList->length) )    {        LinkListNode* current = (LinkListNode*)sList;                for(i=0; i<pos; i++)        {            current = current->next;        }                ret = current->next;        current->next = ret->next;                sList->length--;    }        return ret;}

#include "QueueList.h"#include "LinkList.h"#include <malloc.h>typedef struct _tag_LinkQueueNode{    LinkListNode header;    void* item;} TLinkQueueNode;LinkQueue* LinkQueue_Create(){return LinkList_Create();}void LinkQueue_Destroy(LinkQueue* queue){LinkQueue_Clear(queue);LinkList_Destroy(queue);}void LinkQueue_Clear(LinkQueue* queue){while( LinkQueue_Length(queue) > 0 )    {        LinkQueue_Retrieve(queue);    }}int LinkQueue_Append(LinkQueue* queue, void* item){TLinkQueueNode* node = (TLinkQueueNode*)malloc(sizeof(TLinkQueueNode));int ret = ((node != NULL) && (item != NULL));if(ret){node->item = item;ret = LinkList_Insert(queue, (LinkListNode*)node, LinkList_Length(queue));}if(!ret){    free(node);}return ret;}void* LinkQueue_Retrieve(LinkQueue* queue){TLinkQueueNode* node = (TLinkQueueNode*)LinkList_Delete(queue, 0);void* ret = NULL;if(node){ret =node->item;free(node);}return ret;}void* LinkQueue_Header(LinkQueue* queue){TLinkQueueNode* node = (TLinkQueueNode*)LinkList_Get(queue, 0);void* ret = NULL;if(node != NULL){ret =node->item;}return ret;}int LinkQueue_Length(LinkQueue* queue){return LinkList_Length(queue);}

<pre name="code" class="html">#include <stdio.h>#include <stdlib.h>#include "QueueList.h"/* run this program using the console pauser or add your own getch, system("pause") or input loop */int main(int argc, char *argv[]) {    LinkQueue* queue = LinkQueue_Create();    int a[10] = {0};    int i = 0;        for(i=0; i<10; i++)    {        a[i] = i + 1;                LinkQueue_Append(queue, a + i);    }        printf("Header: %d\n", *(int*)LinkQueue_Header(queue));    printf("Length: %d\n", LinkQueue_Length(queue));        while( LinkQueue_Length(queue) > 0 )    {        printf("Retrieve: %d\n", *(int*)LinkQueue_Retrieve(queue));    }        LinkQueue_Destroy(queue);    return 0;}

0 0