3.28.cpp

来自「严蔚敏数据结构习题C++实现」· C++ 代码 · 共 67 行

#include <iostream>
#define MAX 100000000
using namespace std;
typedef int ElemType;
typedef struct QueueNode
{
    ElemType item;
    QueueNode* next;
}QueueNode,*Tail;

void link_play(const Tail L);
void enqueue(const ElemType item,Tail& t);
void dequeue(ElemType& item,Tail& t);
void init_queue(Tail& L);

int main()
{
    Tail L;
    int x;
    init_queue(L);
    enqueue(3,L);
    enqueue(4,L);
    //cout << L->item << ' ' << L->next->item;
    enqueue(5,L);
    enqueue(6,L);
    dequeue(x,L);
    dequeue(x,L);
    link_play(L);
    system("pause");
    return 0;
}
void init_queue(Tail& L)
{
     L = new QueueNode();
     L->item = MAX;
     L->next = L;
}
void enqueue(const ElemType item,Tail& t)
{
     // cout << t->next->item;
     QueueNode* temp = new QueueNode();
     temp->item = item;
     temp->next = t->next;
     
     t->next = temp;
     t = t->next;
     //cout << t->next->item;
}
void dequeue(ElemType& item,Tail& t)
{
     QueueNode* head = t->next;
     QueueNode* temp = head->next;
     item = temp->item;
     head->next = temp->next;
     free(temp);
}
void link_play(const Tail L)
{
     QueueNode* temp = L->next->next;
     //cout << L->next->item;
     while(temp!=L->next)
     {
         cout << temp->item << ' ';
         temp = temp->next;
     }
}