[LeetCode]232. Implement Queue using Stacks ★

题目描述

Implement the following operations of a queue using stacks.

push(x) – Push element x to the back of queue.
pop() – Removes the element from in front of queue.
peek() – Get the front element.
empty() – Return whether the queue is empty.
题目大意：用栈实现队列的功能

样例

Example:

MyQueue queue = new MyQueue();
queue.push(1);
queue.push(2);
queue.peek(); // returns 1
queue.pop(); // returns 1
queue.empty(); // returns false

python解法

class MyQueue:

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.stack = []
        
    def push(self, x: int) -> None:
        """
        Push element x to the back of queue.
        """
        self.stack.append(x)
        
    def pop(self) -> int:
        """
        Removes the element from in front of queue and returns that element.
        """
        return self.stack.pop(0)
        

    def peek(self) -> int:
        """
        Get the front element.
        """
        return self.stack[0]
        

    def empty(self) -> bool:
        """
        Returns whether the queue is empty.
        """
        return False if self.stack else True
        
# Your MyQueue object will be instantiated and called as such:
# obj = MyQueue()
# obj.push(x)
# param_2 = obj.pop()
# param_3 = obj.peek()
# param_4 = obj.empty()

Runtime: 36 ms, faster than 64.07% of Python3 online submissions for Implement Queue using Stacks.
Memory Usage: 14 MB, less than 10.00% of Python3 online submissions for Implement Queue using Stacks.
题后反思：

C语言解法

typedef struct Queue{
    int val;
    struct Queue *next;
} MyQueue;

/** Initialize your data structure here. */

MyQueue* myQueueCreate() {
    MyQueue *head = (MyQueue*)malloc(sizeof(MyQueue));
    head -> next = NULL;
    return head;
}

/** Push element x to the back of queue. */
void myQueuePush(MyQueue* obj, int x) {
    MyQueue *p = (MyQueue*)malloc(sizeof(MyQueue));
    p -> val = x;
    p -> next = NULL;
    while(obj->next)
        obj = obj -> next;
    obj -> next = p;
}

/** Removes the element from in front of queue and returns that element. */
int myQueuePop(MyQueue* obj) {
    MyQueue*p = obj ->next;
    int val = p -> val;
    obj -> next = p -> next;
    free(p);
    return val;
}

/** Get the front element. */
int myQueuePeek(MyQueue* obj) {
    return obj -> next -> val;
}

/** Returns whether the queue is empty. */
bool myQueueEmpty(MyQueue* obj) {
    return obj -> next ? false:true;
}

void myQueueFree(MyQueue* obj) {
    MyQueue * p = obj;
    while(obj->next)
    {
        p = obj -> next;
        obj -> next = p -> next;
        free(p);
    }
    free(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);
*/

Runtime: 4 ms, faster than 66.25% of C online submissions for Implement Queue using Stacks.
Memory Usage: 7.2 MB, less than 100.00% of C online submissions for Implement Queue using Stacks.
题后反思：

文中都是我个人的理解，如有错误的地方欢迎下方评论告诉我，我及时更正，大家共同进步