编辑代码

#include <stdio.h>
int Enqueue(Stack *S1,Stack *S2,int e){
    if(!isfull(S1))
    {
        push(S1,e);
    }
    if(isfull(S1)&&!isempty(S2))
    {
        printf("队列满");
    }
    if(isfull(S1)&&isempty(S2)){
    while(!isempty(S1))
    {
        pop(S1,x);
        push(S2,x);
    }}
    push (S1,e);
}

int Dequeue(Stack &S1,Stack *S2,int x){
    if(!isempty(S2))
    {
        pop(S2,x)
    }
    else if(isemppty(S1))
    {
        printf("队列空");
    }
    else{
        while(!isemppty(S1)){
        pop(S1,x);
        push(S2,x);}
        pop(S2,x);}
}

int Queueempty(Stack *S1,Stack *S2){
    if(isemppty(S1)&&isemppty(S2))
        printf("队空");
    else printf("队非空");
}

int main(){
    Stack S;
    init(&S);
    push(&S,10);......60
    printf("入队元素为%d\n",Dequeue(&S1,&S2,70));
    printf("出队元素为%d\n",Dequeue(&S1,&S2,10));
    int Queueempty(&S1,&S2);
}