数据结构之队列

队列

@[.DataStructure]

1.抽象操作集

Fisrt In First Out

操作集合	解释
Queue CreatQueue( int MaxSize )	生成长度为MaxSize的空队列。
int IsFullQ( Queue Q, int MaxSize )：	判断队列Q是否已满，若是返回1(TRUE)；否则返回0(FALSE)。
void AddQ( Queue Q, ElementType item )	若队列已经满了，返回已满信息；否则将数据元素item插入到队列Q中去。
int IsEmptyQ( Queue Q )	判断队列Q是否为空，若是返回1(TRUE)；否则返回0(FALSE)。
ElementType DeleteQ( Queue Q )	若队列为空信息，返回队列空信息；否则将队头数据元素从队列中删除并返回。

2.队列的顺序存储实现

2.1

数组实现，假溢出现象

2.2 改进方法，循环队列

#include<iostream>
#include<cstdio>
using namespace std;

#define ElementType int


typedef int Position;
typedef struct QNode * PtrToQNode;
struct QNode
{
	ElementType * Data;
	Position Front, Rear;
	int MaxSize;

};

typedef PtrToQNode Queue;

Queue CreateQueue(int MaxSize)
{
	Queue Q = (Queue)malloc(sizeof(struct QNode));
	Q->Data = (ElementType *)malloc(MaxSize*sizeof(ElementType));
	Q->Front = Q->Rear = 0;
	Q->MaxSize = MaxSize;
	return Q;
}

bool IsFull(Queue Q)
{
	return((Q->Rear + 1) % Q->MaxSize == Q->Front);
}

bool AddQ(Queue Q, ElementType X)
{
	if (IsFull(Q))
	{
		cout << "The Queue is FUll !";
		return false;

	}
	else
	{
		Q->Rear = (Q->Rear + 1) % Q->MaxSize;
		Q->Data[Q->Rear] = X;
		return true;
	}
}

bool IsEmpty(Queue Q)
{
	return(Q->Front == Q->Rear);
}



#define Error 1e10
ElementType DeleteQ(Queue Q)
{
	if (IsEmpty(Q))
	{		
		return Error;
	}
	else
	{
		Q->Front = (Q->Front + 1) % Q->MaxSize;
		return Q->Data[Q->Front];
	}

}

3.队列的链式存储实现

#include<iostream>
#include<cstdio>
using namespace std;

#define ElementType int


typedef struct Node * PtrToNode;

typedef struct Node {
	ElementType  Data;
	struct Node  *Next;
};
typedef PtrToNode Positioin;

typedef struct QNode * PtrToQNode;
struct QNode
{
	Positioin Front, Rear;
	int MaxSize;
};

typedef PtrToQNode Queue;


Queue CreateQueue()
{
	Queue Q = (Queue)malloc(sizeof(struct QNode));
	Q->Front = Q->Rear = (Positioin)malloc(sizeof(Node));

	//Q->Front = Q->Rear = NULL;

	return Q;
}



bool IsEmpty(Queue Q)
{
	return(Q->Front == Q->Rear);
}


#define Error 1e10
ElementType DeleteQ(Queue Q)
{
	Positioin FrontCell;
	ElementType FrontElem;
	if (IsEmpty(Q))
	{
		cout << "The Queue is Empty";
		return Error;
	}
	else
	{
		FrontCell = Q->Front;
		Q->Front = Q->Front->Next;
		FrontElem = FrontCell->Data;
		free(FrontCell);
		return FrontElem;
	}

}

bool AddQ(Queue Q, ElementType X)
{

	Positioin RearCell;
	RearCell = (Positioin)malloc(sizeof(Node));
	RearCell->Data = X;

	Q->Rear->Next = RearCell;
	Q->Rear = Q->Rear->Next;
	return true;

}

int main()
{
	Queue Q = CreateQueue();
	for (size_t i = 0; i < 100; i++)
	{
		AddQ(Q, i);
	}
	cout << "test" << endl;
	for (size_t i = 0; i < 101; i++)
	{
		DeleteQ(Q);
	}
	return 0;
}