用栈来表示队列

#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

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

#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

#include <stdio.h>
#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);
}

#ifndef _SQUEUELIST_H
#define _SQUEUELIST_H

typedef void SQueueList;

SQueueList* SQueueList_Create();

void SQueueList_Destroy(SQueueList* queue);

void SQueueList_Clear(SQueueList* queue);

int SQueueList_Append(SQueueList* queue, void* item);

void* SQueueList_Retrieve(SQueueList* queue);

void* SQueueList_Header(SQueueList* queue);

int SQueueList_Length(SQueueList* queue);


#endif

#include <stdio.h>
#include <malloc.h>
#include "LinkStack.h"
#include "SQueue.h"

typedef struct _tag_SQueue
{
	LinkStack* inStack;
	LinkStack* outStack;	
}TSQueueList;

SQueueList* SQueueList_Create()
{
	TSQueueList* ret = (TSQueueList*)malloc(sizeof(TSQueueList));
	
	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 SQueueList_Destroy(SQueueList* queue)
{
	SQueueList_Clear(queue);
	free(queue);
}

void SQueueList_Clear(SQueueList* queue)
{
	TSQueueList* sQueue = (TSQueueList*)queue;
	
	if(sQueue != NULL)
	{
	   LinkStack_Clear(sQueue->inStack);
	   LinkStack_Clear(sQueue->outStack);	
	}
}

int SQueueList_Append(SQueueList* queue, void* item)
{
	TSQueueList* sQueue = (TSQueueList*)queue;
	if(sQueue != NULL)
	{
	    LinkStack_Push(sQueue->inStack,item);
	}
}

void* SQueueList_Retrieve(SQueueList* queue)
{
	TSQueueList* sQueue = (TSQueueList*)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* SQueueList_Header(SQueueList* queue)
{
	TSQueueList* sQueue = (TSQueueList*)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 SQueueList_Length(SQueueList* queue)
{
	TSQueueList* sQueue = (TSQueueList*)queue;
	int ret = -1;
	
	if(sQueue != NULL)
	{
	     ret =	LinkStack_Size(sQueue->outStack)+LinkStack_Size(sQueue->inStack);
	}
	return ret;
}

测试 程序：

#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[]) 
{
    SQueueList* queue = SQueueList_Create();
    int a[10] = {0};
    int i = 0;
    
    for(i=0; i<10; i++)
    {
        a[i] = i + 1;
        
        SQueueList_Append(queue, a + i);
    }
    
    printf("Header: %d\n", *(int*)SQueueList_Header(queue));
    printf("Length: %d\n", SQueueList_Length(queue));
    
    for(i=0; i<5; i++)
    {
        printf("Retrieve: %d\n", *(int*)SQueueList_Retrieve(queue));
    }
    
    printf("Header: %d\n", *(int*)SQueueList_Header(queue));
    printf("Length: %d\n", SQueueList_Length(queue));
    
    for(i=0; i<10; i++)
    {
        a[i] = i + 1;
        
        SQueueList_Append(queue, a + i);
    }
    
    while( SQueueList_Length(queue) > 0 )
    {
        printf("Retrieve: %d\n", *(int*)SQueueList_Retrieve(queue));
    }
    
    SQueueList_Destroy(queue);
    
	return 0;
}