-*----- Myqueue.h -----*-
#pragma once
#ifndef MYQUEUE_H
#define MYQUEUE_H
#endif // !MYQUEUE_H
class MyQueue
{
public:
MyQueue(int queueCapacity); //InitQueue(&Q) 创建队列
virtual ~MyQueue(); //DestroyQueue(&Q) 销毁队列
void ClearQueue(); //ClearQueue(&Q) 清空队列
bool QueueEmpty() const; //QueueEmpty(Q) 判空队列
int QueueLength() const; //QueueLength(Q) 队列长度
bool QueueFull() const; //QueueFull(Q) 判满队列
bool EnQueue(int element); //EnQueue(&Q, element) 新元素入队
bool DeQueue(int &element); //DeQueue(&Q, element) 首元素出队
void QueueTraverse(); //Queuetraverse(Q, visit()) 遍历队列
private:
int *m_pQueue; //队列数组指针
int m_iQueueLen; //队列元素个数
int m_iQueueCapacity; //队列元素容量
int m_iHead; //队头元素下标
int m_iTail; //队尾元素下标
};
-*----- Myqueue.cpp -----*-
#include "Myqueue.h"
#include <iostream>
using namespace std;
MyQueue::MyQueue(int queueCapacity)
{
m_pQueue = new int[queueCapacity];
m_iQueueLen = 0;
m_iQueueCapacity = queueCapacity;
m_iHead = 0;
m_iTail = 0;
}
MyQueue::~MyQueue()
{
delete []m_pQueue;
m_pQueue = NULL;
}
void MyQueue::ClearQueue()
{
m_iQueueLen = 0;
m_iHead = 0;
m_iTail = 0;
}
bool MyQueue::QueueEmpty() const
{
if (m_iQueueLen == 0)
{
return true;
}
return false;
}
int MyQueue::QueueLength() const
{
return m_iQueueLen;
}
bool MyQueue::QueueFull() const
{
if (m_iQueueLen == m_iQueueCapacity)
{
return true;
}
return false;
}
bool MyQueue::EnQueue(int element)
{
if (!QueueFull())
{
m_pQueue[m_iTail] = element;
m_iTail++;
m_iTail = m_iTail % m_iQueueCapacity;
m_iQueueLen++;
return true;
}
return false;
}
bool MyQueue::DeQueue(int &element)
{
if (!QueueEmpty())
{
element = m_pQueue[m_iHead];
m_iHead++;
m_iHead = m_iHead % m_iQueueCapacity;
m_iQueueLen--;
return true;
}
return false;
}
void MyQueue::QueueTraverse()
{
for (int i = m_iHead; i < m_iQueueLen + m_iHead; i++)
{
cout << m_pQueue[i%m_iQueueCapacity] << endl;
}
cout << endl;
}
-*------ test.cpp -----*-
#include "stdafx.h"
#include "Myqueue.h"
#include <iostream>
using namespace std;
int main()
{
MyQueue *p = new MyQueue(4);
p->EnQueue(10);
p->EnQueue(20);
p->EnQueue(24);
cout << p->QueueLength() << endl;
p->QueueTraverse();
int e = 0;
p->DeQueue(e);
cout << e << endl;
p->ClearQueue();
p->QueueTraverse();
delete p;
p = NULL;
system("pause");
return 0;
}