Python——栈和队列的实现（面向对象方法）

用队列实现栈（LeetCode225）

class MyStack(object):

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.data = []

    def push(self, x):
        """
        Push element x onto stack.
        :type x: int
        :rtype: None
        """
        self.data.append(x)
    def pop(self):
        """
        Removes the element on top of the stack and returns that element.
        :rtype: int
        """
        return self.data.pop()
    def top(self):
        """
        Get the top element.
        :rtype: int
        """
        if len(self.data) == 0:
            return None
        else:
            return self.data[-1]
    def empty(self):
        """
        Returns whether the stack is empty.
        :rtype: bool
        """
        if len(self.data) == 0 :
            return True
        else:
            return False

obj = MyStack()
obj.push(1)
obj.push(2)
p2 = obj.pop()
p3 = obj.top()
p4 = obj.empty()

print(p2,p3,p4)

结果：

用栈实现队列（LeetCode232）

class MyQueue(object):

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.data = []

    def push(self, x):
        """
        Push element x to the back of queue.
        :type x: int
        :rtype: None
        """
        self.data.append(x)
    def pop(self):
        """
        Removes the element from in front of queue and returns that element.
        :rtype: int
        """
        if len(self.data) == 0:
            return None
        else:
            return self.data.pop(0)
    def peek(self):
        """
        Get the front element.
        :rtype: int
        """
        if len(self.data) == 0:
            return None
        else:
            return self.data[0]
    def empty(self):
        """
        Returns whether the queue is empty.
        :rtype: bool
        """
        if len(self.data) == 0:
            return True
        else:
            return False
# Your MyQueue object will be instantiated and called as such:
obj = MyQueue()
obj.push(1)
obj.push(2)
param_2 = obj.pop()
param_3 = obj.peek()
param_4 = obj.empty()
print(param_2,param_3,param_4)

结果：