学生课设，C++数据结构实验，队列的实现，vs2022完整项目，包含完整代码，开箱即用

#include "LinkQueueAlgo.h" void ShowMenu() { cout << "========= 队列的实现及应用 =========" << endl; cout << "1. 初始化队列（使用以下功能前，务必先初始化） " << endl; cout << "2. 销毁队列" << endl; cout << "3. 清空队列" << endl; cout << "4. 判断是否为空队列" << endl; cout << "5. 求队列长度" << endl; cout << "6. 取队头元素" << endl; cout << "7. 入队" << endl; cout << "8. 出队" << endl; cout << "9. 遍历队列" << endl; cout << "0. 退出" << endl; cout << "请输入你的选择："; } void ExitEnter() { cout << "-------------------------------" << endl; system("pause"); system("cls"); } int main() { LinkQueue Q; QElemType e; int numF = 9; //菜单选项数量 int choice; do { ShowMenu(); cin >> choice; while (choice < 0 || choice>numF || cin.fail()) { system("cls"); cin.clear(); cin.ignore(); ShowMenu(); cin >> choice; } switch (choice) { case 1: { // 初始化队列 system("cls"); if (InitQueue(Q)) cout << "队列初始化成功" << endl; else cout << "初始化失败" << endl; ExitEnter(); break; } case 2: { // 销毁队列 system("cls"); if (DestroyQueue(Q)) cout << "销毁队列成功，请初始化队列后继续使用下面的功能" << endl; else cout << "销毁队列失败" << endl; ExitEnter(); break; } case 3: { // 清空队列 system("cls"); if (ClearQueue(Q)) cout << "清空队列成功" << endl; ExitEnter(); break; } case 4: { // 判断是否为空队列 system("cls"); if (QueueEmpty(Q)) cout << "为空队列，可使用“入队”功能添加元素" << endl; else cout << "队列不为空" << endl; ExitEnter(); break; } case 5: { // 求队列长度 system("cls"); int l = QueueLength(Q); cout << "队列长度为：" << l << endl; ExitEnter(); break; } case 6: { // 取队头元素 system("cls"); if (GetHead_Q(Q, e)) { cout << "取队头元素成功" << endl; cout << "队头元素为：" << e.num << endl; } else cout << "取队头元素失败" << endl; ExitEnter(); break; } case 7: { // 入队 system("cls"); cin.ignore(); string s; cout << "不断入队，入队元素用空格隔开，比如：1.2 3 2 8" << endl; cout << "请输入需要入队的元素（double）："; getline(cin, s); istringstream iss(s); string s1; double q; while (iss >> s1) { try { q = stod(s1); } catch (const exception& e) { cout << s1 << "：非数字，跳过" << endl; continue; } e.num = q; if (EnQueue(Q, e)) cout << q << "：入队成功" << endl; else cout << q << "：入队失败" << endl; } ExitEnter(); break; } case 8: { // 出队 system("cls"); if (DeQueue(Q, e)) { cout << "出队成功" << endl; cout << "出队元素为：" << e.num << endl; } else cout << "出队失败" << endl; ExitEnter(); break; } case 9: { // 遍历队列 system("cls"); if (QueueTraverse(Q))cout << "\n遍历成功" << endl; else cout << "遍历失败" << endl; ExitEnter(); break; } case 0: { cout << "-------------------------------" << endl; cout << "感谢使用，再见！" << endl; break; } default: system("cls"); cout << "输入无效，请重新选择！" << endl; break; } } while (choice != 0); return 0; }