C语言 | 栈实现队列

力扣232题

/* 构造一个栈：
 * 栈指针、栈的大小、栈的最大容量
 */
typedef struct Stack {
    int* stk;
    int stkSize;
    int stkCapcaity;
}T_Stack, *PT_Stack;

/* 栈的初始化 */
PT_Stack stackCreate(int capacity) {
    PT_Stack ret = (PT_Stack)malloc(sizeof(T_Stack));
    ret->stk = (int*)malloc(sizeof(int) * capacity);
    ret->stkSize = 0;
    ret->stkCapcaity = capacity;
    return ret;
}

/* 入栈操作 */
void stackPush(PT_Stack obj, int element) {
    obj->stk[obj->stkSize++] = element;
}

/* 出栈操作 */
void stackPop(PT_Stack obj) {
    obj->stkSize--;
}

/* 获得栈顶元素 */
int satckTop(PT_Stack obj) {
    return obj->stk[obj->stkSize - 1];
}

/* 判断栈是否为空 */
int stackEmpty(PT_Stack obj) {
    return obj->stkSize == 0;
}

/* 释放栈的内存空间 */
void satckFree(PT_Stack obj) {
    free(obj->stk);
}

/* 构造队列；使用两个栈 */
typedef struct MyQueue{
    PT_Stack inStack;
    PT_Stack outSatck;
}MyQueue, *PT_MyQueue;

/** Initialize your data structure here. */

PT_MyQueue myQueueCreate() {
    PT_MyQueue ret  = (PT_MyQueue)malloc(sizeof(MyQueue));
    ret->inStack    = stackCreate(100);
    ret->outSatck   = stackCreate(100);
    return ret;
}

/* 入栈向出栈传值 */
void in2out(MyQueue* obj) {
    while(!stackEmpty(obj->inStack)) {
        stackPush(obj->outSatck, satckTop(obj->inStack));
        stackPop(obj->inStack);
    }
}

/** Push element x to the back of queue. */
void myQueuePush(MyQueue* obj, int x) {
    stackPush(obj->inStack, x);
}

/** Removes the element from in front of queue and returns that element. */
int myQueuePop(MyQueue* obj) {
    if (stackEmpty(obj->outSatck)) {
        in2out(obj);
    }
    int x = satckTop(obj->outSatck);
    stackPop(obj->outSatck);
    return x;
}

/** Get the front element. */
int myQueuePeek(MyQueue* obj) {
    if (stackEmpty(obj->outSatck)) {
        in2out(obj);
    }
    return satckTop(obj->outSatck);
}

/** Returns whether the queue is empty. */
bool myQueueEmpty(MyQueue* obj) {
    return stackEmpty(obj->inStack) && stackEmpty(obj->outSatck);
}

void myQueueFree(MyQueue* obj) {
    satckFree(obj->inStack);
    satckFree(obj->outSatck);
}

/**
 * Your MyQueue struct will be instantiated and called as such:
 * MyQueue* obj = myQueueCreate();
 * myQueuePush(obj, x);
 
 * int param_2 = myQueuePop(obj);
 
 * int param_3 = myQueuePeek(obj);
 
 * bool param_4 = myQueueEmpty(obj);
 
 * myQueueFree(obj);
*/