请你仅使用两个栈实现先入先出队列。队列应当支持一般队列支持的所有操作(push、pop、peek、empty):
实现 MyQueue 类:
void push(int x) 将元素 x 推到队列的末尾
int pop() 从队列的开头移除并返回元素
int peek() 返回队列开头的元素
boolean empty() 如果队列为空,返回 true ;否则,返回 false
说明:
你 只能 使用标准的栈操作 —— 也就是只有 push to top, peek/pop from top, size, 和 is empty 操作是合法的。
你所使用的语言也许不支持栈。你可以使用 list 或者 deque(双端队列)来模拟一个栈,只要是标准的栈操作即可。
typedef int STDatatype;
typedef struct Stack
{
STDatatype* a;
int top;
int capacity;
}ST;
typedef struct queue{
ST* st1;//入队列
ST* st2;//出队列
} MyQueue;
void STInit(ST* ps)
{
assert(ps);
ps->a = (STDatatype*)malloc(sizeof(STDatatype) * 4);
if (ps->a == NULL)
{
perror("malloc fail");
return;
}
ps->top = -1;
ps->capacity = 4;
}
void STDestory(ST* ps)
{
assert(ps);
free(ps->a);
ps->top = -1;
ps->capacity = 0;
}
void STPop(ST* ps)
{
assert(ps);
assert(ps->capacity != 0);
(ps->top)--;
}
void STPush(ST* ps, STDatatype x)
{
assert(ps);
if (ps->top == ps->capacity - 1)
{
ps->a = (int*)realloc(ps->a,sizeof(STDatatype) * 2 * (ps->capacity));
ps->capacity *= 2;
}
ps->top++;
*(ps->a+ps->top) = x;
}
int STSize(ST* ps)
{
assert(ps);
return ((ps->top) + 1);
}
STDatatype STTop(ST* ps)
{
assert(ps);
assert(ps->top != -1);
return (ps->a)[ps->top];
}
MyQueue* myQueueCreate() {
MyQueue* obj = (MyQueue*)malloc(sizeof(MyQueue));
obj->st1 = (ST*)malloc(sizeof(ST));
obj->st2 = (ST*)malloc(sizeof(ST));
STInit(obj->st1);
STInit(obj->st2);
return obj;
}
void myQueuePush(MyQueue* obj, int x) {
STPush(obj->st1,x);
}
int myQueuePop(MyQueue* obj) {
if (obj->st2->top == -1)
{
//倒数据
while (obj->st1->top != -1)
{
int ret = STTop(obj->st1);
STPop(obj->st1);
STPush(obj->st2,ret);
}
}
int ret = STTop(obj->st2);
STPop(obj->st2);
return ret;
}
int myQueuePeek(MyQueue* obj) {
if (obj->st2->top == -1)
{
//倒数据
while (obj->st1->top != -1)
{
int ret = STTop(obj->st1);
STPop(obj->st1);
STPush(obj->st2,ret);
}
}
int ret = STTop(obj->st2);
return ret;
}
bool myQueueEmpty(MyQueue* obj) {
if (obj->st1->top == -1 && obj->st2->top == -1)
{
return true;
}
else
{
return false;
}
}
void myQueueFree(MyQueue* obj) {
free(obj->st1->a);
free(obj->st2->a);
free(obj->st1);
free(obj->st2);
free(obj);
}