第七周 项目一 建立顺序环形队列

目的：建立顺序环形队列。

代码：

#include <iostream>#include <cstdio>#include "shunxuduidetouwenjian.h"using namespace std;int main(){     sqqueue * q;     chushihuashunxudui(q);     A e;     e='a';     jinshunxudui(q,e);     e='b';     jinshunxudui(q,e);     e='c';     jinshunxudui(q,e);     cout<<panduanshunxuduiweikong(q)<<endl;     cout<<chushunxudui(q,e)<<endl;     cout<<shunxuduichangdu(q)<<endl;     e='d';     jinshunxudui(q,e);     e='e';     jinshunxudui(q,e);     e='f';     jinshunxudui(q,e);     cout<<shunxuduichangdu(q)<<endl;     while(q->wei!=q->tou)     {          cout<<q->tou+1<<" ";          chushunxudui(q,e);     }     cout<<endl;     cuihuishunxudui(q);     return 0;}#include <iostream>#include <cstdio>#include "shunxuduidetouwenjian.h"using namespace std;int main(){     sqqueue * q;     chushihuashunxudui(q);     A e;     e='a';     jinshunxudui(q,e);     e='b';     jinshunxudui(q,e);     e='c';     jinshunxudui(q,e);     cout<<panduanshunxuduiweikong(q)<<endl;     cout<<chushunxudui(q,e)<<endl;     cout<<shunxuduichangdu(q)<<endl;     e='d';     jinshunxudui(q,e);     e='e';     jinshunxudui(q,e);     e='f';     jinshunxudui(q,e);     cout<<shunxuduichangdu(q)<<endl;     while(q->wei!=q->tou)     {          cout<<q->tou+1<<" ";          chushunxudui(q,e);     }     cout<<endl;     cuihuishunxudui(q);     return 0;}#include <iostream>#include <cstdio>#include "shunxuduidetouwenjian.h"using namespace std;int main(){     sqqueue * q;     chushihuashunxudui(q);     A e;     e='a';     jinshunxudui(q,e);     e='b';     jinshunxudui(q,e);     e='c';     jinshunxudui(q,e);     cout<<panduanshunxuduiweikong(q)<<endl;     cout<<chushunxudui(q,e)<<endl;     cout<<shunxuduichangdu(q)<<endl;     e='d';     jinshunxudui(q,e);     e='e';     jinshunxudui(q,e);     e='f';     jinshunxudui(q,e);     cout<<shunxuduichangdu(q)<<endl;     while(q->wei!=q->tou)     {          cout<<q->tou+1<<" ";          chushunxudui(q,e);     }     cout<<endl;     cuihuishunxudui(q);     return 0;}

运行图：