数据结构课后题目源码

#ifndef QUEUE_H_
#define QUEUE_H_
#include <iostream>

using namespace std;

template<class T>
class Queue{
private:
int front,rear;
T * elements;
int maxSize;
int tag;
public:
Queue(int sz = 10);
~Queue();
bool EnQueue(const T & x);
bool DeQueue(T & x);
};

template<class T>
Queue<T>::Queue(int sz)
{
maxSize = sz;
tag = 0;
elements = new T[maxSize];
front = rear = 0;
}

template<class T>
Queue<T>::~Queue()
{
delete[] elements;
}

template<class T>
bool Queue<T>::EnQueue(const T & x)
{
if (front == rear&&tag == 1)
{
cout << "The queue is full!" << endl;
return false;
}
elements[rear] = x;
rear = (rear + 1) % maxSize;
tag = 1;
return true;
}

template<class T>
bool Queue<T>::DeQueue(T & x)
{
if (front == rear&&tag == 0)
{
cout << "The queue is empty!" << endl;
return false;
}
x = elements[front];
front = (front + 1) % maxSize;
tag = 0;
return true;
}
#endif

// ex3-23.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include "Queue.h"

int _tmain(int argc, _TCHAR* argv[])
{
Queue<int> queue(5);
int j;
queue.DeQueue(j);
int x = 5;
for (int i = 0; i < 5; i++)
{
queue.EnQueue(x);
}
int y = 6;
queue.EnQueue(y);
system("pause");
return 0;
}