栈实现队列

要求：用两个栈实现队列先进先出的特点
思路：stack1不断入栈，就是入队操作，之后将元素弹到stack2中，再将元素弹出就是出队操作
例子：2,3,4,5,6进入stack1后变为2,3,4,5,6。弹出到stack2中变为6,5,4,3,2
再弹出就是2,3,4,5,6

代码：

/*
    Name: Two_Stack_Achieve_Queue
    Author: Bryant_xw
    Date: 2018-09-28-10.39.24
*/
#include<bits/stdc++.h>
using namespace std;

typedef struct Node
{
    int n;
    struct Node* next;
}StackNode;

typedef struct m_stack
{
    int nCount;
    StackNode* pTop;
}Stack;

void init(Stack** st)
{
    *st = (Stack*)malloc(sizeof(Stack));
    (*st)->nCount = 0;
    (*st)->pTop = NULL;
}

void Push(Stack* st, int num)
{
    if(st == NULL)
        return ;
    StackNode* temp = (StackNode*)malloc(sizeof(StackNode));
    temp->n = num;
    temp->next = st->pTop;
    st->pTop = temp;
    st->nCount++;
}

int Pop(Stack* st)
{
    if(st == NULL ||st->pTop == NULL)
        return -1;
    int res;
    StackNode *pDel = NULL;
    pDel = st->pTop;
    st->pTop = st->pTop->next;
    res = pDel->n;
    free(pDel);
    st->nCount--;
    return res;
}

bool IsEmpty(Stack* st)
{
    if(st->nCount == 0)
        return true;
    return false;
}

int GetStackTop(Stack* st)
{
    if(st == NULL)
        return -1;
    return st->pTop->n;
}

typedef struct m_queue
{
    Stack* stack1;
    Stack* stack2;
    int nCount;
}Queue;

void queue_init(Queue** que)
{
    *que = (Queue*)malloc(sizeof(Queue));
    (*que)->nCount = 0;
    init(&((*que)->stack1));
    init(&((*que)->stack2));
}

void Enqueue(Queue* que,int num)
{
    if(que == NULL)
        return;
    Push(que->stack1,num);
    que->nCount++;
}

int DeQueue(Queue *que)
{
    int tmp;
    while(!IsEmpty(que->stack1)){
        tmp = GetStackTop(que->stack1);
        Push(que->stack2,tmp);
        Pop(que->stack1);
    }
    int res = Pop(que->stack2);
    que->nCount--;
    return res;
}

int main(){
    Queue* que = NULL;
    queue_init(&que);

    for(int i = 0; i < 5; ++i)
        Enqueue(que,i+2);
    printf("queue size is: %d\n",que->nCount);
    for(int i = 0; i < 5; ++i){
        if(i != 4)
            printf("%d ",DeQueue(que));
        else
            printf("%d ",DeQueue(que));
    }
    puts("");
    return 0;
}