笔记4：队列

1、顺序队列

#ifndef __SQQUEUE_H__
#define __SQQUEUE_H__
#include "error.h"

#define TRUE  1
#define FALSE 0

#define SIZE 10
typedef int QueueData;
typedef struct _queue
{
	QueueData data[SIZE];
	int front;     // 指向队头的下标
	int rear;      // 指向队尾的下标
}Queue;

// 置空队
int InitQueue (Queue *Q);  

// 判队空否
int QueueEmpty (Queue *Q);  

// 判队满否       
int QueueFull (Queue *Q);      

// 进队  
int EnQueue (Queue *Q, QueueData x);     

// 出队  
int DeQueue (Queue *Q, QueueData *x);

// 取队头
int GetFront (Queue *Q, QueueData *x);


#endif // __SQQUEUE_H__

#include "SqQueue.h"

int InitQueue (Queue *q)
{
	if (q == NULL)
	{
		errno = ERROR;
		return FALSE;
	}
	
	// 置空队
	q->front = 0;
	q->rear  = 0;
	
	return TRUE;
}

int QueueEmpty (Queue *q)
{
	if (q == NULL)
	{
		errno = ERROR;
		return FALSE;
	}
	
	return q->front == q->rear;
}


int QueueFull (Queue *q) 
{
	if (q == NULL)
	{
		errno = ERROR;
		return FALSE;
	}
	
	
	return q->front == (q->rear+1)%SIZE;
} 

int EnQueue (Queue *q, QueueData x)
{
	if (q == NULL)
	{
		errno = ERROR;
		return FALSE;
	}
	
	if (QueueFull(q))
	{
		errno = FULL_QUEUE;	
		return FALSE;
	}
	
	q->rear = (q->rear+1) % SIZE;
	q->data[q->rear] = x;
	
	return TRUE;
}

int DeQueue (Queue *q, QueueData *x)
{
	if (q == NULL)
	{
		errno = ERROR;
		return FALSE;
	}
	
	if (QueueEmpty(q))
	{
		errno = EMPTY_QUEUE;
		return FALSE;
	}
	q->front = (q->front + 1) % SIZE;
	*x = q->data[q->front];
	
	return TRUE;
}

int GetFront (Queue *q, QueueData *x)
{
	if (q == NULL)
	{
		errno = ERROR;
		return FALSE;
	}
	
	if (QueueEmpty(q))
	{
		errno = EMPTY_QUEUE;
		return FALSE;
	}
	int index = (q->front + 1) % SIZE;
	*x = q->data[index];
	
	return TRUE;
}

2、链式队列

#ifndef __LINKQUEUE_H__
#define __LINKQUEUE_H__
#include "error.h"

#define TRUE  1
#define FALSE 0

typedef int QueueData;
typedef struct _node
{
	QueueData data;
	struct _node *next;
}Node;

typedef struct _queue
{
	Node *front;
	Node *rear;
}Queue;

Queue* Create_Queue();

int QueueEmpty (Queue *Q);   

// 进队
int EnQueue (Queue *Q, QueueData x);   

// 出队
int DeQueue (Queue *Q, QueueData *x);

// 取队头
int GetFront (Queue *Q, QueueData *x);

int Destroy_Queue (Queue *Q);

#endif // __LINKQUEUE_H__

#include "LinkQueue.h"
#include <stdlib.h>

Queue* Create_Queue()
{
	Queue * q = (Queue*)malloc(sizeof(Queue)/sizeof(char));
	if (q == NULL)
	{
		errno = MALLOC_ERROR;
		return NULL;
	}
	
	// 置空队
	q->front = NULL;
	q->rear  = NULL;
	
	return q;
}

int QueueEmpty (Queue *q)
{
	if (q == NULL)
	{
		errno = ERROR;
		return FALSE;
	}
	
	
	return q->front == NULL;
}

int EnQueue (Queue *q, QueueData x)
{
	if (q == NULL)
	{
		errno = ERROR;
		return FALSE;
	}
	
	Node * node = (Node*)malloc(sizeof(Node)/sizeof(char));
	if (node == NULL)
	{
		errno = MALLOC_ERROR;
		return FALSE;
	}
	node->data = x;
	node->next = NULL;
	
	if (q->front == NULL)
	{
		q->front = node;
		q->rear  = node;
	}
	else
	{
		q->rear->next = node;
		q->rear = node;
	}
	
	return TRUE;
}

int DeQueue (Queue *q, QueueData *x)
{
	if (q == NULL)
	{
		errno = ERROR;
		return FALSE;
	}
	
	if (QueueEmpty(q))
	{
		errno = EMPTY_QUEUE;
		return FALSE;
	}
		
	Node *p = q->front;
	*x = p->data;
	
	q->front = p->next;
	free(p);
	
	if (q->front == NULL)
		q->rear = NULL;
		
	return TRUE;
}

int GetFront (Queue *q, QueueData *x)
{
	if (q == NULL)
	{
		errno = ERROR;
		return FALSE;
	}
	
	if (QueueEmpty(q))
	{
		errno = EMPTY_QUEUE;
		return FALSE;
	}
		
	*x = q->front->data;
		
	return TRUE;
}

int Destroy_Queue (Queue *q)
{
	if (q == NULL)
	{
		errno = ERROR;
		return FALSE;
	}
	
	int x;
	while (QueueEmpty(q) != TRUE)
	{
		DeQueue(q, &x);
	}
	
	free(q);
	
	return TRUE;
}