快捷導(dǎo)航

C++實(shí)現(xiàn)循環(huán)隊(duì)列

更新時(shí)間：2020年01月13日 11:42:19 作者：My_Algorithm

這篇文章主要為大家詳細(xì)介紹了C++實(shí)現(xiàn)循環(huán)隊(duì)列，文中示例代碼介紹的非常詳細(xì)，具有一定的參考價(jià)值，感興趣的小伙伴們可以參考一下

本文實(shí)例為大家分享了C++實(shí)現(xiàn)循環(huán)隊(duì)列的具體代碼，供大家參考，具體內(nèi)容如下

circularQueue.h

#pragma once
#pragma once
#ifndef CIRCULARQUEUE_H
#define CIRCULARQUEUE_H
 
#include<iostream>
#include<ostream>
using std::cout;
using std::cin;
using std::endl;
using std::ostream;
template<class T> class cirQueue;
 
template<typename T>
class cirQueue
{
public:
 cirQueue(int sz);
 ~cirQueue();
 void push(const T& elem);//進(jìn)隊(duì)
 void pop(T& elem);//出隊(duì)
 bool empty();//查看隊(duì)列是否為空
 int getSize();//返回隊(duì)列中元素的個(gè)數(shù)
 void clearQueue();//清空隊(duì)列中的元素
 void print();//打印隊(duì)列中的元素
 int getfront() { return front; }
 int getrear() { return rear; }
 bool getTop(T& elem);//讀取隊(duì)列首個(gè)元素
 
 template<typename T>
 friend ostream& operator<<(ostream& os, cirQueue<T>& queue);
 
private:
 bool _full()const;//判斷隊(duì)列是否已滿
 int maxsize;//隊(duì)列最大的空間
 T* element;//存放于隊(duì)列中的元素?cái)?shù)組
 int front;//模擬隊(duì)頭指針
 int rear;//模擬隊(duì)尾指針
};
 
 
template<typename T>
cirQueue<T>::cirQueue(int sz) {
 maxsize = sz;
 element = new T[maxsize];
 if (element == nullptr)
 cout << "內(nèi)存分配失敗" << endl;
 front = 0;
 rear = 0;
}
 
 
template<typename T>
cirQueue<T>::~cirQueue() {
 if (element != nullptr)
 delete element;
}
 
//進(jìn)隊(duì)
template<typename T>
void cirQueue<T>::push(const T& elem) {//需要保證隊(duì)尾指針位置與首個(gè)元素相差一個(gè)位置
 if (rear > (maxsize - 1))
 rear -= maxsize ;
 if (front > (maxsize - 1))
 front -= maxsize ;
 if (!_full()) {//隊(duì)列未滿的情況 
 element[rear++] = elem;//隊(duì)尾向后移動(dòng)一位
 //++rear;
 }
 else {
 cout << "隊(duì)列已滿，不能插入！" << endl;
 return;
 }
}
 
//出隊(duì)
template<typename T>
void cirQueue<T>::pop(T& elem) {
 if (rear > (maxsize - 1))
 rear -= (maxsize - 1);
 if (front > (maxsize - 1))
 front -= (maxsize - 1);
 if (!empty()) {//隊(duì)列未空的情況
 elem = element[front++];//隊(duì)頭向后移動(dòng)一位
 element[front - 1] = 0;//置零
 }
 else {
 cout << "隊(duì)列已空！" << endl;
 return;
 }
}
 
//查看隊(duì)列是否為空
template<typename T>
bool cirQueue<T>::empty() {
 if (front == rear)//待定
 return true;
 return false;
}
 
//返回隊(duì)列中元素的個(gè)數(shù)
template<typename T>
int cirQueue<T>::getSize() {
 int num = 0;
 if (front <= rear)
 return rear - front;
 else
 return maxsize - front + rear + 1;
}
 
//清空隊(duì)列中的元素
template<typename T>
void cirQueue<T>::clearQueue() {
 if (!empty())
 {
 int Index = 0;
 while (front < rear) {//front逼近rear
  element[front++] = 0;
  if (front == rear)
  return;
 }
 if (rear < front) {
  while (front <= maxsize - 1)//刪除front至數(shù)組尾端的數(shù)據(jù)
  element[front++] = 0;
  front -= maxsize;
  while (front < rear) {//刪除front至rear的數(shù)據(jù)
  element[front++] = 0;
  if (front == rear)
   return;
  }
 }
 }
}
 
//打印隊(duì)列中的元素
template<typename T>
void cirQueue<T>::print() {//與clearQueue函數(shù)原理一致，將front替換為Index
 if (!empty())
 {
 int Index = front;
 while (Index < rear) {
  cout << element[Index++] << " ";
  if (Index == rear) {
  cout << endl;
  return;
  }
 }
 if (rear < Index) {
  while (Index <= maxsize - 1)
  cout << element[Index++] << " ";
  Index -= maxsize;
  while (Index < rear) {
  cout << element[Index++] << " ";
  if (Index == rear) {
   cout << endl;
   return;
  }
  }
 }
 }
}
 
//讀取隊(duì)列首個(gè)元素
template<typename T>
bool cirQueue<T>::getTop(T& elem) {
 if (!empty()) {
 elem = element[front];
 return true;
 }
 return false;
}
 
template<typename T>
ostream& operator<<(ostream& os, cirQueue<T>& queue) {
 os << "隊(duì)列中的元素?cái)?shù)量為：" << queue.getSize() << endl;
 return os;
}
 
//判斷隊(duì)列是否已滿
template<typename T>
bool cirQueue<T>::_full()const {
 if (front - rear == 1 || front - rear == -maxsize + 1)
 return true;
 return false;
}
 
#endif // !CIRCULARQUEUE_H

main.cpp

#include"CircularQueue.h"
 
 
int main()
{
 cirQueue<int> cq(20);
 int a = 0;
 for (int i = 0; i < 19; i++)
 {
 cq.push(i);
 }
 cq.print();
 cout << cq;
 for (int i = 0; i < 20; i++)
 {
 cq.pop(a);
 }
 cout << cq;//此時(shí)front=rear=19
 cout << cq.getfront() << "  " << cq.getrear() << endl;
 //for (int i = 19; i < 25; i++)
 //{
 // cq.push(i);
 //}
 cq.push(19);
 cq.print();
 cout << cq.getfront() << "  " << cq.getrear() << endl;
 cout << endl << endl;
 cq.push(20); 
 cq.getTop(a);
 cout << a << endl;
 cq.print();
 cout << cq.getfront() << "  " << cq.getrear() << endl;
 return 1;
}

以上就是本文的全部內(nèi)容，希望對(duì)大家的學(xué)習(xí)有所幫助，也希望大家多多支持腳本之家。

您可能感興趣的文章: