實驗二 順序隊列

#include<iostream> using namespace std; const int QueueSize=100; class CirQueue { public: CirQueue() { front=rear=QueueSize-1; } ~CirQueue(){} void EnQueue(int x); int DeQueue(); int GetQueue(); int E

>>阅读原文<<