#include<stdio.h>
#include<stdlib.h>
#include<assert.h>
#include<string.h>
#include"stack.h"
typedef struct TSQueue
{
Stack s1;
Stack s2;
}TSQueue,*PTSQueue;
void my_Init_Queue(PTSQueue pq);
bool my_Push(PTSQueue pq, ELEMTYPE val);
bool my_Pop(PTSQueue pq, ELEMTYPE* rtval);
bool my_Top(PTSQueue pq, ELEMTYPE* rtval);
int my_Get_length(PTSQueue pq);
bool my_IsEmpty(PTSQueue pq);
bool my_IsFull(PTSQueue pq);
void my_Clear(PTSQueue pq);
#include"Two_stack_queue.h"
void my_Init_Queue(PTSQueue pq)
{
assert(pq != NULL);
Init_stack(&pq->s1);
Init_stack(&pq->s2);
}
bool my_Push(PTSQueue pq, ELEMTYPE val)
{
assert(pq != NULL);
return Push(&pq->s1,val);
}
bool my_Pop(PTSQueue pq, ELEMTYPE* rtval)
{
assert(pq != NULL);
if (my_IsEmpty(pq))
{
return false;
}
if (IsEmpty(&pq->s2))
{
while (!IsEmpty(&pq->s1))
{
int tmp;
Pop(&pq->s1,&tmp);
Push(&pq->s2, tmp);
}
return Pop(&pq->s2, rtval);
}
else
{
return Pop(&pq->s2, rtval);
}
}
bool my_Top(PTSQueue pq, ELEMTYPE* rtval)
{
assert(pq != NULL);
if (my_IsEmpty(pq))
{
return false;
}
if (IsEmpty(&pq->s2))
{
while (!IsEmpty(&pq->s1))
{
int tmp;
Pop(&pq->s1, &tmp);
Push(&pq->s2, tmp);
}
return Top(&pq->s2, rtval);
}
else
{
return Top(&pq->s2, rtval);
}
}
int my_Get_length(PTSQueue pq)
{
assert(pq != NULL);
int count = Get_length(&pq->s1) + Get_length(&pq->s2);
return count;
}
bool my_IsEmpty(PTSQueue pq)
{
assert(pq != NULL);
if (IsEmpty(&pq->s1) && IsEmpty(&pq->s2))
{
return true;
}
return false;
}
void my_Clear(PTSQueue pq)
{
assert(pq != NULL);
Clear(&pq->s1);
Clear(&pq->s2);
}
void my_Destroy(PTSQueue pq)
{
assert(pq != NULL);
Destory(&pq->s1);
Destory(&pq->s2);
}
void my_Show(PTSQueue pq)
{
assert(pq != NULL);
Show(&pq->s1);
printf("\n");
}
void my_Show1(PTSQueue pq)
{
assert(pq != NULL);
Show(&pq->s2);
printf("\n");
}
int main()
{
TSQueue pq;
my_Init_Queue(&pq);
for (int i = 0; i < 20; i++)
{
my_Push(&pq, i + 1);
}
my_Show(&pq);
int tmp;
my_Pop(&pq, &tmp);
my_Show1(&pq);
printf("%d ", tmp);
int temp;
my_Top(&pq, &temp);
my_Show1(&pq);
printf("%d ", temp);
return 0;
}