队列与栈的综合实现

1.#include <stdio.h>
#include <stdlib.h>
#include "SQueue.h"

/* run this program using the console pauser or add your own getch, system("pause") or input loop 用于测试逻辑代码的实现 */

int main(int argc, char *argv[])
{
    SQueue* queue = SQueue_Create();
    int a[10] = {0};
    int i = 0;

    for(i=0; i<10; i++)
    {
        a[i] = i + 1;

        SQueue_Append(queue, a + i);
    }

    printf("Header: %d ", *(int*)SQueue_Header(queue));
    printf("Length: %d ", SQueue_Length(queue));

    for(i=0; i<5; i++)
    {
        printf("Retrieve: %d ", *(int*)SQueue_Retrieve(queue));
    }

    printf("Header: %d ", *(int*)SQueue_Header(queue));
    printf("Length: %d ", SQueue_Length(queue));

    for(i=0; i<10; i++)
    {
        a[i] = i + 1;

        SQueue_Append(queue, a + i);
    }

    while( SQueue_Length(queue) > 0 )
    {
        printf("Retrieve: %d ", *(int*)SQueue_Retrieve(queue));
    }

    SQueue_Destroy(queue);

   return 0;
}

2.#ifndef _SQUEUE_H_
#define _SQUEUE_H_
/* 实现队列封装的函数 */

typedef void SQueue;

SQueue* SQueue_Create();

void SQueue_Destroy(SQueue* queue);

void SQueue_Clear(SQueue* queue);

int SQueue_Append(SQueue* queue, void* item);

void* SQueue_Retrieve(SQueue* queue);

void* SQueue_Header(SQueue* queue);

int SQueue_Length(SQueue* queue);

#endif

3.#include <stdio.h>
#include <malloc.h>
#include "LinkStack.h"
#include "SQueue.h"
/* 实现具于栈与队列的综合实例 */
typedef struct _tag_SQueue
{
    LinkStack* inStack;
    LinkStack* outStack;
} TSQueue;
//创建队列
SQueue* SQueue_Create() // O(1)
{
    TSQueue* ret = (TSQueue*)malloc(sizeof(TSQueue));

    if( ret != NULL )
    {
        ret->inStack = LinkStack_Create();
        ret->outStack = LinkStack_Create();

        if( (ret->inStack == NULL) || (ret->outStack == NULL) )
        {
            LinkStack_Destroy(ret->inStack);
            LinkStack_Destroy(ret->outStack);

            free(ret);

            ret = NULL;
        }
    }

    return ret;
}
//销毁队列
void SQueue_Destroy(SQueue* queue) // O(n)
{
    SQueue_Clear(queue);
    free(queue);
}
//清空队列
void SQueue_Clear(SQueue* queue) // O(n)
{
    TSQueue* sQueue = (TSQueue*)queue;

    if( sQueue != NULL )
    {
        LinkStack_Clear(sQueue->inStack);
        LinkStack_Clear(sQueue->outStack);
    }
}
//入队列
int SQueue_Append(SQueue* queue, void* item) // O(1)
{
    TSQueue* sQueue = (TSQueue*)queue;
    //当队列不为空入队列
    if( sQueue != NULL )
    {
        LinkStack_Push(sQueue->inStack, item);
    }
}
//出队列
void* SQueue_Retrieve(SQueue* queue) // O(1)
{
    TSQueue* sQueue = (TSQueue*)queue;
    void* ret = NULL;

    if( sQueue != NULL )
    {
   //当输出队列为空
        if( LinkStack_Size(sQueue->outStack) == 0 )
        {
       //输入队列有元素
            while( LinkStack_Size(sQueue->inStack) > 0 )
            {
       //往输出队列中压栈
                LinkStack_Push(sQueue->outStack, LinkStack_Pop(sQueue->inStack));
            }
        }
        //否则就出栈
        ret = LinkStack_Pop(sQueue->outStack);
    }

    return ret;
}
//取头元素
void* SQueue_Header(SQueue* queue) // O(1)
{
    TSQueue* sQueue = (TSQueue*)queue;
    void* ret = NULL;

    if( sQueue != NULL )
    {
        if( LinkStack_Size(sQueue->outStack) == 0 )
        {
            while( LinkStack_Size(sQueue->inStack) > 0 )
            {
                LinkStack_Push(sQueue->outStack, LinkStack_Pop(sQueue->inStack));
            }
        }

        ret = LinkStack_Top(sQueue->outStack);
    }

    return ret;
}
//取出队列长度
int SQueue_Length(SQueue* queue) // O(1)
{
    TSQueue* sQueue = (TSQueue*)queue;
    int ret = -1;

    if( sQueue != NULL )
    {
        ret = LinkStack_Size(sQueue->inStack) + LinkStack_Size(sQueue->outStack);
    }

    return ret;
}

4.#ifndef _LINKSTACK_H_
#define _LINKSTACK_H_

typedef void LinkStack;

LinkStack* LinkStack_Create();

void LinkStack_Destroy(LinkStack* stack);

void LinkStack_Clear(LinkStack* stack);

int LinkStack_Push(LinkStack* stack, void* item);

void* LinkStack_Pop(LinkStack* stack);

void* LinkStack_Top(LinkStack* stack);

int LinkStack_Size(LinkStack* stack);

#endif

5.#include <malloc.h>
#include "LinkStack.h"
#include "LinkList.h"

typedef struct _tag_LinkStackNode
{
    LinkListNode header;
    void* item;
} TLinkStackNode;

LinkStack* LinkStack_Create()
{
    return LinkList_Create();
}

void LinkStack_Destroy(LinkStack* stack)
{
    LinkStack_Clear(stack);
    LinkList_Destroy(stack);
}

void LinkStack_Clear(LinkStack* stack)
{
    while( LinkStack_Size(stack) > 0 )
    {
        LinkStack_Pop(stack);
    }
}

int LinkStack_Push(LinkStack* stack, void* item)
{
    TLinkStackNode* node = (TLinkStackNode*)malloc(sizeof(TLinkStackNode));
    int ret = (node != NULL) && (item != NULL);

    if( ret )
    {
        node->item = item;

        ret = LinkList_Insert(stack, (LinkListNode*)node, 0);
    }

    if( !ret )
    {
        free(node);
    }

    return ret;
}

void* LinkStack_Pop(LinkStack* stack)
{
    TLinkStackNode* node = (TLinkStackNode*)LinkList_Delete(stack, 0);
    void* ret = NULL;

    if( node != NULL )
    {
        ret = node->item;

        free(node);
    }

    return ret;
}

void* LinkStack_Top(LinkStack* stack)
{
    TLinkStackNode* node = (TLinkStackNode*)LinkList_Get(stack, 0);
    void* ret = NULL;

    if( node != NULL )
    {
        ret = node->item;
    }

    return ret;
}

int LinkStack_Size(LinkStack* stack)
{
    return LinkList_Length(stack);
}

6.#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

7.#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;
}