数据结构清华大学队列实现

最新推荐文章于 2023-12-30 23:10:15 发布

CooperNiu

最新推荐文章于 2023-12-30 23:10:15 发布

阅读量397

点赞数 1

CC 4.0 BY-SA版权

分类专栏：数据结构

本文链接：https://blog.youkuaiyun.com/CooperNiu/article/details/53001395

数据结构专栏收录该内容

9 篇文章

订阅专栏

本文通过一个C++程序演示了队列的基本操作，包括初始化、获取长度、插入元素、检查是否为空、删除元素以及获取队首元素等。每一步操作都通过用户输入选择，并给出相应的反馈。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

//main.cpp

#include <iostream>
using namespace std;
#include "Queue.h"
int main() {
    int n;
    ElemType e;
    SqQueue Q;
    while (1)
    {// 实现多次测试
        cout << "Please input a number to choose:";
        cin >> n;
        switch (n)
        {
            case 1:
                if(Init(Q))
                    cout<<"Init queue successfully!\n";
                else
                    cout<<"Init fail!\n";
                break;
            case 2: cout<<QueueLength(Q);
                break;
            case 3: cout<<"Please insert a element into the queue:";
                    cin >> e;
                    if(EnQueue(Q, e))
                        cout<<"Insert element successfully!\n";
                    else
                        cout<<"Insert fail!\n";
                break;
            case 4:
                if(QueueEmpty(Q))
                    cout<<"Empty!\n";
                else
                    cout<<"Not empty!\n";
                break;
            case 5: cout<<"Please input a element to delete:";
                    cin>>e;
                    if(DeQueue(Q, e))
                        cout<<"Delete element successfully!\n";
                    else
                        cout<<"Delete fail!\n";
                break;
            case 6: if(GetHead(Q,e))
                        cout<<"head element is:" << e << endl;
                    else
                        cout<<"Gethead fail!\n";
                break;
            case 7:
            case 0: exit(1);
            default: cout<<"ERROR, please input again!\n";
        }
    }//while
    return 0;
}