代码随想录day10|232.用栈实现队列、225. 用队列实现栈

最新推荐文章于 2025-12-16 14:17:05 发布

原创最新推荐文章于 2025-12-16 14:17:05 发布 · 252 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法

代码随想录专栏收录该内容

37 篇文章

订阅专栏

本文介绍了如何使用栈结构实现队列功能，以及如何用队列结构实现栈功能，通过示例代码展示了创建、操作和销毁这两种数据结构的方法。

题目链接：232.用栈实现队列

代码实现

typedef struct {
    int stackInTop, stackOutTop;
    int stackin[100], stackout[100];
} MyQueue;


MyQueue* myQueueCreate() {
    MyQueue* queue = (MyQueue*)malloc(sizeof(MyQueue));
    queue->stackInTop = 0;
    queue->stackOutTop = 0;
    return queue;
}

void myQueuePush(MyQueue* obj, int x) {
    obj->stackin[(obj->stackInTop)++] = x;
}

int myQueuePop(MyQueue* obj) {
    int stackInTop = obj->stackInTop;
    int stackOutTop = obj->stackOutTop;

    if(stackOutTop == 0){
        while(stackInTop > 0){
            obj->stackout[stackOutTop++] = obj->stackin[--stackInTop];
        }       
    
    }
    int top = obj->stackout[--stackOutTop];
    while(stackOutTop > 0)
        obj->stackin[stackInTop++] = obj->stackout[--stackOutTop];
    
    obj->stackInTop = stackInTop;
    obj->stackOutTop = stackOutTop;
    return top;
}

int myQueuePeek(MyQueue* obj) {
    return obj->stackin[0];
}

bool myQueueEmpty(MyQueue* obj) {
    return obj->stackInTop == 0  && obj->stackOutTop == 0;
}

void myQueueFree(MyQueue* obj) {
    obj->stackInTop = 0;
    obj->stackOutTop = 0;
}

题目链接：225. 用队列实现栈

代码实现



typedef struct {
    int queue[100];
    int front;
    int rear;
} MyStack;

MyStack* myStackCreate() {
    MyStack* stack = (MyStack*)malloc(sizeof(MyStack));
    stack->front = 0;
    stack->rear = 0;
    return stack;
}

void myStackPush(MyStack* obj, int x) { obj->queue[(obj->rear)++] = x; }

int myStackPop(MyStack* obj) {
    int front = obj->front;
    int rear = obj->rear;

    int size = rear - front;
    while (size-- > 1) {
        obj->queue[rear++] = obj->queue[front++];
    }
    int top = obj->queue[front++];

    obj->front = front;
    obj->rear = rear;
    return top;
}

int myStackTop(MyStack* obj) {return obj->queue[(obj->rear) - 1];}

bool myStackEmpty(MyStack* obj) { return obj->rear == obj->front; }

void myStackFree(MyStack* obj) {
    obj->front = 0;
    obj->rear = 0;
}

/**
 * Your MyStack struct will be instantiated and called as such:
 * MyStack* obj = myStackCreate();
 * myStackPush(obj, x);

 * int param_2 = myStackPop(obj);

 * int param_3 = myStackTop(obj);

 * bool param_4 = myStackEmpty(obj);

 * myStackFree(obj);
*/