每日一题(3):使用两个栈实现一个队列

#pragma once
#include "stack1.h"
#include <stdio.h>
typedef struct SQueue{
  Stack stack1;//入数据
  Stack stack2;//出数据
}SQueue;
 
//初始化
void Init(SQueue *pSQ)
{
  Stack *p1, *p2;
  p1 = &(pSQ->stack1);
  p2 = &(pSQ->stack2);
  StackInit(p1);
  StackInit(p2);
}
//入栈
void Push(SQueue *pSQ, SDataType data)
{
  Stack *p1, *p2;
  p1 = &(pSQ->stack1);
  p2 = &(pSQ->stack2);
  StackPush(p1, data);
}
 
//出栈
void Pop(SQueue *pSQ)
{
  Stack *p1, *p2;
  p1 = &(pSQ->stack1);
  p2 = &(pSQ->stack2);
  SDataType data;
 
  if(StackIsEmpty(p2))
  {
    while(!StackIsEmpty(p1))
    {
      data=StackTop(p1);
      StackPop(p1);
      StackPush(p1, data);
    }
  }
     StackPop(p2);
}
 
SDataType Front(SQueue *pSQ)
{
  Stack *p1, *p2;
  p1 = &(pSQ->stack1);
  p2 = &(pSQ->stack2);
  SDataType data;
 
  if (StackIsEmpty(p2))
  {
    while (!StackIsEmpty(p1))
    {
      data = StackTop(p1);
      StackPop(p1);
      StackPush(p1, data);
    }
  }
  return StackTop(p2);
}