#ifndef PERMUTE_H
#define PERMUTE_H
#include
using namespace std;
const int QueueSize = 100;
template
struct Node{
T data;
Node *next;
};
template
class LinkQueue{
private:
Node *front,*rear;
public:
LinkQueue();
virtual ~LinkQueue();
virtual void Trans(); //遍历缓冲轨
void EnQueue(T x);
T DeQueue();
T GetFront(){
if(front!=rear)
return front->next->data;
}
T GetRear()
{
if(front!=rear)
return rear->data;
}
bool Empty()
{
front== NULL?return 1:return 0;
}
friend void TrainPermute(int arr[],LinkQueue a[],int n,int k);
};
template
LinkQueue::LinkQueue(){
Node *s=new Node;
s->next=NULL;
front=rear=s;
}
template
LinkQueue::~LinkQueue(){
Node *p=front;
while(p!=NULL){
Node *q=p;
p=p->next;
delete q;
}
}
template
void LinkQueue::EnQueue(T x){
Node *s=new Node;
s->next=NULL;
s->data=x;
rear->next=s;
rear=s;
}
template
T LinkQueue::DeQueue(){
if(rear==front)
throw"下溢";
Node *p=fr
火车车厢重排C++
最新推荐文章于 2024-07-17 23:24:31 发布