编辑代码

#include <bits/stdc++.h>
using namespace std;
struct Node{
    int data;
    Node *next;
};
struct Queue{
    Node *front,*rear;
};
void init(Queue &Q){
    Q.front=Q.rear=(Node *)malloc(sizeof(Node));
    Q.front->next=nullptr;
}
void push(Queue &Q,int x){
    Node *p=(Node *)malloc(sizeof(Node));
    p->data=x;
    p->next=nullptr;
    Q.rear->next=p;
    Q.rear=p;
}
bool isEmpty(Queue Q){
    return Q.rear==Q.front;
}
bool pop(Queue &Q,int &x){
    if(isEmpty(Q))return false;
    Node *p=Q.front->next;
    x=p->data;
    Q.front->next=p->next;
    if(Q.rear==p)Q.rear=Q.front;
    free(p);
    return true;
}
int getFront(Queue Q){
    if(!isEmpty(Q))
    return Q.front->next->data;
    else return -1;
}
int getRear(Queue Q){
    if(!isEmpty(Q))
    return Q.rear->data;
    else return -1;
}
int main() {
    Queue Q;
    init(Q);
    push(Q,1);
    // push(Q,2);
    int x=-1;
    // pop(Q,x);
    pop(Q,x);
    cout<<getFront(Q)<<'\n';
    cout<<getRear(Q);
	return 0;
}