【数据结构】链式队列的表示和实现

痛定思痛。 2021-11-27 01:10 252阅读 0赞

#include<iostream>
    using namespace std;
    typedef struct QNode {
        int data;
        struct QNode *next;
    }QNode, *QueuePtr;
    typedef struct {
        QueuePtr head;
        QueuePtr front;
        QueuePtr rear;
    }LinkQueue;
    
    bool InitLQueue(LinkQueue &LQ) {
        LQ.front = LQ.rear = new QNode;
        if (LQ.front)
            return true;
        return false;
    }
    
    bool LQueueEmpty(LinkQueue LQ) {
        if (LQ.front == LQ.rear) {
            cout<<"LinkQueue is Empty"<<endl;
            return true;
        }
        return false;
    }
    
    bool EnLQueue(LinkQueue &LQ, int data) {
        QNode *n = new QNode;
        n->next = NULL;
        if (!n)
            return false;
        LQ.rear->data = data;
        LQ.rear->next = n;
        LQ.rear = n;
        return true;
    }
    
    bool DeLQueue(LinkQueue &LQ, int &data) {
        if (!LQueueEmpty(LQ)) {
            QNode *p = LQ.front;
            data = p->data;
            LQ.front = p->next;
            delete p;
            return true;
        }
        return false;
    }
    
    void PrintLQueue(LinkQueue LQ) {
        QNode *p = LQ.front;
        while (p->next) {
            cout<<p->data<<" ";
            p = p->next;
        }
        cout<<endl;
    }
    
    int main() {
        LinkQueue LQ;
        InitLQueue(LQ);
        cout<<"EnLQueue 9 elements"<<endl;
        for (int i=0; i<9; i++)
            EnLQueue(LQ, i);
    
        PrintLQueue(LQ);
        cout<<endl<<"DeLQueue 5 elements"<<endl;
        for (int i=0, e; i<5; i++) {
            DeLQueue(LQ, e);
            cout<<"After DeLQueue "<<e<<endl;
            PrintLQueue(LQ);
        }
        cout<<endl<<"EnLQueue 3 elements"<<endl;
        for (int i=0; i<3; i++)
            EnLQueue(LQ, i*i*i);
        PrintLQueue(LQ);
        return 0;
    }

// 测试结果
    EnLQueue 9 elements
    0 1 2 3 4 5 6 7 8
    
    DeLQueue 5 elements
    After DeLQueue 0
    1 2 3 4 5 6 7 8
    After DeLQueue 1
    2 3 4 5 6 7 8
    After DeLQueue 2
    3 4 5 6 7 8
    After DeLQueue 3
    4 5 6 7 8
    After DeLQueue 4
    5 6 7 8
    
    EnLQueue 3 elements
    5 6 7 8 0 1 8