int myStackPop(MyStack* obj) 
{
   if(QueueEmpty(&obj->list1))//如果队列1不为空,就把队列2的前n-1个元素导入到队列1
   {
       while(QueueSize(&obj->list2)>1)//size>1进入while循环保证要剩下一个元素
       {
           QueuePush(&obj->list1,QueueFront(&obj->list2));//在第一个队列中插入第二个队列的元素
           QueuePop(&obj->list2);//队列2的元素导出去一个就要删除一下,保证下一个元素到队头
       }
       int top= QueueFront(&obj->list2);//记录队列2的最后一个元素做为栈顶
       QueuePop(&obj->list2);//再将最后一个元素删除,从此队列2从满元素变为空
       return top;//将记录好的数据返回
   }
   else//思路和上面一样,不过这个地方是队列2为空时
   {
         while(QueueSize(&obj->list1)>1)
       {
           QueuePush(&obj->list2,QueueFront(&obj->list1));
           QueuePop(&obj->list1);
       }
       int top= QueueFront(&obj->list1);
       QueuePop(&obj->list1);
       return top;
   }
}

typedef int QDataType;
typedef struct QueueNode
{
  struct QueueNode* next;
  QDataType data;
}QN;
typedef struct Queue
{
  QN* head;
  QN* tail;
}Queue;
void QueueInit(Queue* pq);//初始化
void QueueDestroy(Queue* pq);//销毁
void QueeuPrint(Queue* pq);//打印
void QueuePush(Queue* pq,QDataType x);//插入
void QueuePop(Queue* pq);//删除
QDataType QueueFront(Queue* pq);//取队头的数据
QDataType QueueBack(Queue* pq);//取队尾的数据
size_t QueueSize(Queue* pq);//求队列有多少数据
bool QueueEmpty(Queue* pq);//判断队列是否为空
void QueueInit(Queue* pq)
{
  assert(pq);
  pq->head = NULL;
  pq->tail = NULL;
}
void QueueDestroy(Queue* pq)
{
  assert(pq);
  QN* cur = pq->head;
  while (cur != NULL)//如果是不等于pq->tail,最后一个数据没有被销毁
  {
  QN* next = cur->next;
  free(cur);
  cur = next;
  }
  pq->head = pq->tail = NULL;
}
void QueeuPrint(Queue* pq)
{
  assert(pq);
  QN* cur = pq->head;
  while (cur != NULL)
  {
  printf("%d ", cur->data);
  cur = cur->next;
  }
  printf("\n");
}
void QueuePush(Queue* pq,QDataType x)
{
  assert(pq);
    QN* newnode = (QN*)malloc(sizeof(QN));
  newnode->data = x;
  newnode->next = NULL;
  if (pq->head == NULL)//head为空的情况
  {
  pq->head = pq->tail = newnode;
  }
  else
  {
  pq->tail->next = newnode;
  pq->tail = newnode;
  }
}
void QueuePop(Queue* pq)//实际上是头删
{
  assert(pq);
  assert(pq->head != NULL);
  QN* cur = pq->head;
  QN* next = cur->next;
  free(cur);
  cur = NULL;
  pq->head = next;
  if (pq->head == NULL)//当删除到最后一个数据时,要把tail一起置空,否则下次再插入数据会出问题
  {
  pq->tail = NULL;
  }
}
QDataType QueueFront(Queue* pq)
{
  assert(pq);
  assert(pq->head);
  QN* cur = pq->head;
  return cur->data;
}
QDataType QueueBack(Queue* pq)
{
  assert(pq);
  assert(pq->head);
  QN* cur = pq->tail;
  return cur->data;
}
size_t QueueSize(Queue* pq)
{
  assert(pq);
  int count = 0;
        QN* cur = pq->head;
  while (cur)
  {
    count++;
    cur = cur->next;
  }
  return count;
}
bool QueueEmpty(Queue* pq)
{
  assert(pq);
  if (pq->head == NULL)
  {
  return true;
  }
  else
  {
  return false;
  }
}
typedef struct {
Queue list1;
Queue list2;
} MyStack;
MyStack* myStackCreate() {
MyStack* qu=(MyStack*)malloc(sizeof(MyStack));
QueueInit(&qu->list1);
QueueInit(&qu->list2);
return qu;
}
void myStackPush(MyStack* obj, int x) 
{
    if(QueueEmpty(&obj->list1))
    {
        QueuePush(&obj->list2,x);
    }
    else
    {
        QueuePush(&obj->list1,x);
    }
}
int myStackPop(MyStack* obj) 
{
   if(QueueEmpty(&obj->list1))
   {
       while(QueueSize(&obj->list2)>1)
       {
           QueuePush(&obj->list1,QueueFront(&obj->list2));
           QueuePop(&obj->list2);
       }
       int top= QueueFront(&obj->list2);
       QueuePop(&obj->list2);
       return top;
   }
   else
   {
         while(QueueSize(&obj->list1)>1)
       {
           QueuePush(&obj->list2,QueueFront(&obj->list1));
           QueuePop(&obj->list1);
       }
       int top= QueueFront(&obj->list1);
       QueuePop(&obj->list1);
       return top;
   }
}
int myStackTop(MyStack* obj) {
if(QueueEmpty(&obj->list1))
{
    return QueueBack(&obj->list2);
}
else
{
    return QueueBack(&obj->list1);
}
}
bool myStackEmpty(MyStack* obj) {
return QueueEmpty(&obj->list1)&&QueueEmpty(&obj->list2);
}
void myStackFree(MyStack* obj) {
QueueDestroy(&obj->list1);
QueueDestroy(&obj->list2);
free(obj);
}

int myQueuePeek(MyQueue* obj) {//取队头数据
if(StackEmpty(&obj->popST))//若出数据栈中没有数据,就将入数据栈中数据导入进去
   {
       while(!StackEmpty(&obj->pushST))
       {
           StackPush(&obj->popST,StackTop(&obj->pushST));
           StackPop(&obj->pushST);
       }
   }
   return StackTop(&obj->popST);//返回出数据栈的栈顶元素,即为队列的队头
}