Files
data-structures-and-algorithms/homework3/test2.cpp
T

26 lines
485 B
C++

//test2.cpp
#include<iostream>
#include"SeqQueue.h" //SeqQueue类见第三问
using namespace std;
int main() {
SeqQueue q;
initSeqQueue(q);
for (int i = 1; i <= 8; ++i) {
enQueue(q, i);
}
int present = 1;
while (!isEmpty(q)) {
if (present == 1) {
cout << deQueue(q) << " ";
present = 2;
} else {
enQueue(q, deQueue(q));
present = 1;
}
}
cout << endl;
return 0;
}