#include<iostream>#include"MyQueue.h"using namespace std;MyQueue::MyQueue(int queueCapacity){ m_iQueueCapacity = queueCapacity; m_pQueue = new int[m_iQueueCapacity]; ClearQueue();}MyQueue::~MyQueue(){ delete []m_pQueue; m_pQueue = NULL;}void MyQueue::ClearQueue(){ m_iHead = 0; m_iTail = 0; m_iQueueLen = 0;}?bool MyQueue::QueueEmpty() const?{//法1： if (m_iQueueLen == 0) { return true; } else { return false; }//法2： //return m_iQueueLen == 0 ? true : false;?}// 獲取 隊(duì)列長度?int MyQueue::QueueLength() const???{ return m_iQueueLen;?}?//獲取 隊(duì)列是否為滿?bool MyQueue::QueueFull() const?{ if (m_iQueueLen == m_iQueueCapacity) { return true; } else { return false; }?}?//新元素入隊(duì)?bool MyQueue::EnQueue(int element)?{ if (QueueFull()) { return false; } else { m_pQueue[m_iTail] == element; m_iTail++; m_iTail = m_iTail % m_iQueueCapacity; m_iQueueLen++; return true; }?}?//首元素出隊(duì)??bool MyQueue::DeQueue(int &element)?{ if (QueueEmpty()) { return false; } else { element = m_pQueue[m_iHead]; m_iHead++; m_iHead = m_iHead % m_iQueueCapacity; m_iQueueLen--; return true; }?}?//遍歷隊(duì)列?void MyQueue::QueueTraverse()?{ cout << "遍歷隊(duì)列" <<endl; for (int i = m_iHead; i < m_iQueueLen + m_iHead; i++) { cout << m_pQueue[i % m_iQueueLen] << endl; } cout << endl;?}