Leetcode 刷题 - 225 - Implement Stack using Queues

Implement the following operations of a stack using queues.

• push(x) -- Push element x onto stack.
• pop() -- Removes the element on top of the stack.
• top() -- Get the top element.
• empty() -- Return whether the stack is empty.

Notes:

• You must use only standard operations of a queue -- which means only push to back, peek/pop from front, size, and is empty operations are valid.
• Depending on your language, queue may not be supported natively. You may simulate a queue by using a list or deque (double-ended queue), as long as you use only standard operations of a queue.
• You may assume that all operations are valid (for example, no pop or top operations will be called on an empty stack).

根据题意，就是让你自己利用queue的逻辑来构造一个stack。Queue FIFO, Stack FILO.

class Stack(object):
    def __init__(self):
        self.queue = [] # queue is the main Queue
        self.temp = None # temp is the helper
        
    def push(self, x):
        self.queue.append(x) 

    def pop(self):
        self.queue.pop()
        
    def top(self):
        self.temp = self.queue.pop()
        self.queue.append(self.temp)
        return self.temp

    def empty(self):
        return len(self.queue) == 0

以上虽然通过了，但是在逻辑上，初始化的list在接下来的方法实现中并没有遵循queue的逻辑。基本上是用了python的list，当做了一个stack在进行操作。

class Stack(object):
    def __init__(self):
        self.queue1 = [] # queue1 is the main Queue
        self.queue2 = [] # queue2 is the helper Queue
        

    def push(self, x):
        self.queue1.append(x)
        

    def pop(self):
        for i in range(len(self.queue1)-1): # copy queue1 to queue2, except the last in Queue
            self.queue2.append(self.queue1.pop(0))
        self.queue1.pop(0) # pop the last in the Queue
        for i in range(len(self.queue2)): # move all back to queue1
            self.queue1.append(self.queue2.pop(0))

    def top(self):
        for i in range(len(self.queue1)-1): # copy queue1 to queue2, except the last in Queue
            self.queue2.append(self.queue1.pop(0))
        temp = self.queue1.pop(0) # pop the last in the Queue
        for i in range(len(self.queue2)): # move all back to queue1
            self.queue1.append(self.queue2.pop(0))
        self.queue1.append(temp) # add the popped one
        return temp

    def empty(self):
        return not self.queue1

以上，queue1作为主要的Queue, 功能是存储所有elements，保持stack。queue2的作用是，当需要top，或者pop的时候，暂时的过度queue1中的elements，因为Queue是FIFO的，而Stack是FILO的。所以Stack需要pop的是Queue的最后的element。