火车车厢重排.docVIP

#includeiostream using namespace std; struct Node{ int data; Node * next; }; class Queue { friend ostream operator(ostream os,const Queue cq); public: Queue(); Queue(int a[],int n); ~Queue(); void MakeEmpty(); void Enqueue(int newItem); int Dequeue(); int GetFirstItem() { if(front-next==NULL) { return -1; } return front-next-data; } int GetLastItem() { if(rear!=front) { return rear-data; } return NULL; } Node * front,* rear; private: }; Queue::Queue() { front=new Node; rear=front; front-next=NULL; } Queue::Queue(int a[],int n) { front=new Node; rear=front; front-next=NULL; for(int i=0;in;i++) { Enqueue(a[i]); } } Queue::~Queue() { MakeEmpty(); delete front; } void Queue::MakeEmpty() { while(front-next) { Dequeue(); } } void Queue::Enqueue(int newItem) { Node * s; s=new Node; s-data=newItem; s-next=NULL; rear-next=s; rear=s; } int Queue::Dequeue() { int x; if(rear==front) return NULL; Node * p; p=new Node; p=front-next; x=p-data; front-next=p-next; if(p-next==NULL) rear=front; delete p; return x; } ostream operator(ostream os,const Queue cq) { Node * p=cq.front-next; while(p){ osp-data ; p=p-next; } osendl; return os; } bool ChongPai(int a[],int n,int k) { int nowout=1; Queue *que; que= new Queue[n]; int x,j; Queue q(a,n); do { x=q.GetFirstItem(); if(x==nowout) { nowout++; que[k-1].Enqueue(x); q.Dequeue(); } else { for(j=0;jk;j++) { if(que[j].GetLastItem()==NULL) { que[j].Enqueue(x); q.Dequeue(); break; } if(que[j].GetLastItem()x) { que[j].Enqueue(x); q.Dequeue(); break; } } if(j=k-1) { cout车厢无法重排！endl; return false ; } } for(int m=0;mk-1;m++) { if(que[m].GetFirstItem()==nowout) { que[k-1].Enqueue(que[m].GetFirstItem()); que[m].Dequeue(); nowout++; } } if(que[k-1].GetLastItem()==n) { cout火车车厢入轨的顺序为：endl; coutque[k-1]; return t