队列的c++实现（类模板，顺序实现和链表实现）

最新推荐文章于 2024-04-24 06:00:00 发布

原创最新推荐文章于 2024-04-24 06:00:00 发布 · 1k 阅读

1 ·

CC 4.0 BY-SA版权

c++ 专栏收录该内容

7 篇文章

订阅专栏

本文介绍了两种队列数据结构的实现方法：顺序队列和链式队列，并提供了相应的测试代码来验证这两种队列的基本操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

头文件：

#ifndef QUEUE_H_INCLUDED
#define QUEUE_H_INCLUDED
#include <iostream>
using namespace std;
template <class elemType>
class Queue{
  public:
      virtual bool isEmpty()=0;
      virtual void enQueue(const elemType &x)=0;
      virtual elemType deQueue()=0;
      virtual elemType getHead()=0;
      virtual ~Queue(){}
};

template <class elemType>
class seqQueue:public Queue<elemType>
{private:
       elemType *elem;
	 int maxSize;
	 int Front, rear;

	 void doubleSpace();
 public:
   seqQueue(int Size = 10)
        { elem = new elemType[Size];
           maxSize = Size; Front = rear = 0; }
   ~seqQueue() {delete [ ] elem;}
   bool isEmpty() {return Front == rear;}
   void enQueue(const elemType &x) ;
   elemType deQueue();
   elemType getHead()
        {if (Front!=rear) return elem[(Front + 1) % maxSize];}
};

template <class elemType>
class linkQueue:public Queue<elemType>{
  private:
      struct node{
        elemType data;
        node *next;
        node(const elemType &x,node *p=NULL){data=x; next=p;}
        node():next(NULL){}
        ~node(){}
      };
      node *Front,*rear;
  public:
    linkQueue(){Front=rear=NULL;}
    ~linkQueue();
    void enQueue(const elemType &x);
    elemType deQueue();
    bool isEmpty(){return (Front==NULL);}
    elemType getHead(){return Front->data;}
};
#include "seqQueue.cpp"
#include "linkQueue.cpp"
#endif // QUEUE_H_INCLUDED

顺序实现：

#ifndef cpp1_h
#define cpp1_h

#include "Queue.h"
template <class elemType>
void seqQueue<elemType>::doubleSpace()
{	elemType *tmp =elem;
 	elem = new elemType[2 * maxSize];
 	for (int i = 1; i < maxSize; ++i)
	 	elem[i] = tmp[(Front + i) % maxSize];

 	Front = 0; rear = maxSize - 1;
 	maxSize *= 2;
 	delete tmp;
}

template <class elemType>
void seqQueue<elemType>::enQueue(const elemType &x)
{ if ((rear + 1) % maxSize == Front) doubleSpace();
  rear = (rear + 1) % maxSize;
  elem[rear] = x;
}

template <class elemType>
elemType seqQueue<elemType>::deQueue()
{ Front = (Front + 1) % maxSize;
  return elem[Front];
}
#endif // cpp1_h

链表实现：

#ifndef cpp2_h
#define cpp2_h
#include "Queue.h"
template <class elemType>
linkQueue<elemType>::~linkQueue(){
  node *q=Front,*p;
  while(q!=NULL){
    p=q->next;
    delete q;
    q=p;
  }
}

template <class elemType>
void linkQueue<elemType>::enQueue(const elemType &x){
  node *tmp;
  if (Front==NULL) {
    tmp=new node(x);
    rear=Front=tmp;
  }
  else{
    tmp=new node(x);
    rear->next=tmp;
    rear=tmp;
  }
}

template <class elemType>
elemType linkQueue<elemType>::deQueue(){
  node *tmp;
  elemType value=Front->data;
  tmp=Front;
  Front=Front->next;
  if (Front==NULL) rear=NULL;
  delete tmp;
  return value;
}
#endif // cpp2_h

主函数（测试用）：

#include <iostream>
#include "Queue.h"
using namespace std;

int main()
{
    seqQueue<int> seq;
    linkQueue<int> link;
    seq.enQueue(1);
    seq.enQueue(2);
    cout<<seq.getHead();
    seq.deQueue();
    seq.deQueue();
    cout<<seq.isEmpty();

    link.enQueue(3);
    link.enQueue(4);
    cout<<link.getHead();
    link.deQueue();
    link.deQueue();
    cout<<link.isEmpty();
    return 0;
}