快捷導(dǎo)航

C++代碼實(shí)現(xiàn)鏈隊(duì)列詳解

更新時(shí)間：2021年09月27日 10:18:14 作者：果醬包

下面小編就為大家分享一篇C++代碼實(shí)現(xiàn)鏈隊(duì)列的示例，具有很好的參考價(jià)值，希望對(duì)大家有所幫助。一起跟隨小編過來(lái)看看吧，希望能夠給你帶來(lái)幫助

主要功能：

初始化、入隊(duì)、出隊(duì)、取隊(duì)頭元素、銷毀隊(duì)列、輸出隊(duì)列

完整代碼展示：

#include <iostream>
using namespace std;
#define MAXSIZE 100
typedef struct QueNode{  //定義鏈隊(duì)列存儲(chǔ)結(jié)構(gòu)
    int data;
    QueNode * next;
}QNode,*QuePtr;
typedef struct {  //定義鏈隊(duì)列指針
    QuePtr front;  //隊(duì)頭指針
    QuePtr rear;  //隊(duì)尾指針
}LinkQue;
bool InitQue(LinkQue &Q){  //初始化
    Q.front = Q.rear = new QNode;
    if (!Q.front) return false;
    Q.front->next = NULL;
    return true;
}
bool DestoryQue(LinkQue &Q){  //銷毀表
    while (Q.front){
        Q.rear = Q.front->next;
        delete(Q.front);
        Q.front = Q.rear;
    }
    return true;
}
bool EnQue(LinkQue &Q,int e){  //入隊(duì)
    QuePtr p = new QNode;
    if(!p) return false;
    p->data = e;
    p->next = NULL;
    Q.rear->next = p;
    Q.rear = p;
    return true;
}
bool OutQue(LinkQue &Q,int e){  //出隊(duì)
    if(Q.front == Q.rear) return false;  //隊(duì)空
    QuePtr p = Q.front->next;
    e = p->data;
    Q.front->next = p->next;
    if(Q.rear == p) Q.rear = Q.front;
    delete p;
    return true;
}
bool GetHead(LinkQue Q,int &e){  //取隊(duì)頭元素
    if(Q.front == Q.rear) return false;
    e = Q.front->next->data;
    return true;
}
void ShowList(LinkQue Q){   //輸出鏈隊(duì)
    QuePtr p = Q.front->next;
    while (p){
        cout<<p->data<<" ";
        p = p->next;
    }
    cout<<endl;
}
int main() {
    LinkQue Q;
    int e;
    int choose = -1;
    cout<<"1.入隊(duì)-------------------2.出隊(duì)"<<endl;
    cout<<"3.取頭元素---------------4.銷毀"<<endl;
    cout<<"5.輸出鏈隊(duì)---------------0.退出"<<endl;
    InitQue(Q);
    while (choose != 0) {
        cout << "請(qǐng)選擇功能：";
        cin >> choose;
        switch (choose) {
            case 1:
                cout << "請(qǐng)輸入入隊(duì)元素：";
                cin >> e;
                if (EnQue(Q, e))
                    cout << "入隊(duì)成功" << endl;
                break;
            case 2:
                if (OutQue(Q, e))
                    cout << "出隊(duì)成功" << endl;
                break;
            case 3:
                if (GetHead(Q, e))
                    cout << "隊(duì)頭元素為" << e << endl;
                break;
            case 4:
                if (DestoryQue(Q))
                    cout << "銷毀成功" << endl;
                break;
            case 5:
                cout << "隊(duì)列元素為：";
                ShowList(Q);
                break;
        }
    }
    return 0;
}

運(yùn)行結(jié)果圖：