leetcode-232. 用栈实现队列-C语言

最新推荐文章于 2024-07-25 18:27:28 发布

weixin_36094222

最新推荐文章于 2024-07-25 18:27:28 发布

阅读量480

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/weixin_36094222/article/details/91350813

版权

LeetCode 专栏收录该内容

251 篇文章 10 订阅

订阅专栏


#define LEN 0xfffff

typedef struct {
    int *stack1;
    int stack_index1;
    int *stack2;
    int stack_index2;
} MyQueue;

/** Initialize your data structure here. */

MyQueue* myQueueCreate() {
    MyQueue* obj = (MyQueue* )malloc(sizeof(MyQueue));
    obj->stack1 = (int *)malloc(sizeof(int) * LEN);
    obj->stack2 = (int *)malloc(sizeof(int) * LEN);
    obj->stack_index1 = 0;
    obj->stack_index2 = 0;
    
    return obj;
}

/** Push element x to the back of queue. */
void myQueuePush(MyQueue* obj, int x) {
    obj->stack1[obj->stack_index1++] = x;
}

/** Removes the element from in front of queue and returns that element. */
int myQueuePop(MyQueue* obj) {
    int ret;
    
    if(!obj->stack_index2) {
        while(obj->stack_index1){
            obj->stack2[obj->stack_index2++] = obj->stack1[--obj->stack_index1];
        }
    }
    
    ret = obj->stack2[--obj->stack_index2];
    return ret;
}

/** Get the front element. */
int myQueuePeek(MyQueue* obj) {
    if(!obj->stack_index2) {
        while(obj->stack_index1){
            obj->stack2[obj->stack_index2++] = obj->stack1[--obj->stack_index1];
        }
    }
    
    return obj->stack2[obj->stack_index2-1];  
}

/** Returns whether the queue is empty. */
bool myQueueEmpty(MyQueue* obj) {
    if(!obj->stack_index1 && !obj->stack_index2) return true;
    return false;
}

void myQueueFree(MyQueue* obj) {
    
}

/**
 * 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);
*/