5-1链队入队出队操作

链队基本操作。

#include<iostream>
using namespace std;

#define OK 1
#define ERROR 0
typedef int Status;
typedef char QElemType;
typedef struct QNode {
    QElemType data;
    struct QNode *next;
} QNode, *QueuePtr;

typedef struct {
    QueuePtr front; 
    QueuePtr rear; 
} LinkQueue;

Status InitQueue(LinkQueue &Q) {
    Q.front = Q.rear = new QNode; 
    Q.front->next = NULL;
    return OK;
}

Status EnQueue(LinkQueue &Q, QElemType e) {
    QueuePtr p;
    p = new QNode; 
    p->data = e; 
    p->next = NULL;
    
Q.rear->next=p
; 
    
Q.rear=p
; 
    return OK;
}

Status DeQueue(LinkQueue &Q, QElemType &e) {
    QueuePtr p;
    if (Q.front == Q.rear)
        return ERROR; 
    p = Q.front->next; 
    e = p->data; 
    
Q.front->next=p->next
; 
    if (Q.rear == p)
        
Q.rear=Q.front
; 
    delete p;
    return OK;
}

int main() {
    LinkQueue Q;
    int n,m,i; 
    char c;
    InitQueue(Q);
    cin >> n;
    for(i=0;i<n;i++){
        cin >> c;
        EnQueue(Q,c);        
    }
    for(i=0;i<n;i++){
        DeQueue(Q,c);
    }
    cin >> m;
    for(i=0;i<m;i++){
        cin >> c;
        EnQueue(Q,c);        
    }
    for(i=0;i<m;i++){
        DeQueue(Q,c);
        cout << c << " ";
    }
    return 0;
}

答案：

Q.rear->next=p
Q.rear=p
    
Q.front->next=p->next
Q.rear=Q.front